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 selection of a suitable navigation area is pivotal in aircraft scene matching guidance technology.This study addresses the challenge of identifying suitable reference image ranges for precise scene matching,which ...The selection of a suitable navigation area is pivotal in aircraft scene matching guidance technology.This study addresses the challenge of identifying suitable reference image ranges for precise scene matching,which is crucial for enhancing aircraft positioning accuracy.Traditional methods for image matchability analysis are often limited by their reliance on manual feature parameter design and threshold-based filtering,resulting in suboptimal accuracy and efficiency.This paper proposes a novel network architecture for selecting suitable navigation areas using image Matching Level Segmentation(MLSNet).The approach involves two key innovations:a method for generating segmentation labels that quantify matchability levels and an end-to-end network architecture for rapid and precise prediction of reference image matchability segmentation maps.The network includes two core modules:the saliency analysis module uses multi-layer convolutional networks to accurately detect image saliency features across various levels and scales;the multidimensional attention module utilizes attention mechanisms to focus on feature channels and spatial neighborhood scenes to assess the image’s matchability.Our method was rigorously tested on an extensive collection of remote sensing images,where it was benchmarked against a range of both traditional and cutting-edge deep learning methods.The findings indicate that MLSNet is significantly superior to traditional methods in accuracy and efficiency of matchability analysis,and is also relatively ahead of state-of-the-art deep learning models.展开更多
Many bird species are known to differ in their vocal repertoires between populations across a range of geographic scales.This is generally assumed to be caused by acoustic drift and social learning of small difference...Many bird species are known to differ in their vocal repertoires between populations across a range of geographic scales.This is generally assumed to be caused by acoustic drift and social learning of small differences in songs among individuals in separate populations.To determine the extent to which vocal repertoire is structured in a highly nomadic species with a low degree of isolation among populations,we characterized the vocalizations of the'Apapane(Himatione sanguinea)and described the variations in its songs on a microgeographic scale.'Apapane had significant shifts in their songs in both fragmented and non-fragmented forest habitats,with little to no overlap in song meme structure within distances as short as 2 km,despite birds moving freely between areas with distinct songs.Forest fragments had unique song compositions and shared more syllables with closer fragments than with the ones further apart.Furthermore,microgeographic variation was relatively stable at a given recording location even over multiple years.This pattern of song differentiation in a highly mobile species at the microgeographic scale may be a consequence of their ability to learn new vocalizations over their life and of intraspecific mimicry,or“vocal matching”by individuals visiting other populations.展开更多
Internet of Things(IoT)interconnects devices via network protocols to enable intelligent sensing and control.Resource-constrained IoT devices rely on cloud servers for data storage and processing.However,this cloudass...Internet of Things(IoT)interconnects devices via network protocols to enable intelligent sensing and control.Resource-constrained IoT devices rely on cloud servers for data storage and processing.However,this cloudassisted architecture faces two critical challenges:the untrusted cloud services and the separation of data ownership from control.Although Attribute-based Searchable Encryption(ABSE)provides fine-grained access control and keyword search over encrypted data,existing schemes lack of error tolerance in exact multi-keyword matching.In this paper,we proposed an attribute-based multi-keyword fuzzy searchable encryption with forward ciphertext search(FCS-ABMSE)scheme that avoids computationally expensive bilinear pairing operations on the IoT device side.The scheme supportsmulti-keyword fuzzy search without requiring explicit keyword fields,thereby significantly enhancing error tolerance in search operations.It further incorporates forward-secure ciphertext search to mitigate trapdoor abuse,as well as offline encryption and verifiable outsourced decryption to minimize user-side computational costs.Formal security analysis proved that the FCS-ABMSE scheme meets both indistinguishability of ciphertext under the chosen keyword attacks(IND-CKA)and the indistinguishability of ciphertext under the chosen plaintext attacks(IND-CPA).In addition,we constructed an enhanced variant based on type-3 pairings.Results demonstrated that the proposed scheme outperforms existing ABSE approaches in terms of functionalities,computational cost,and communication cost.展开更多
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.展开更多
In the era of the Internet of Things,distributed computing alleviates the problem of insufficient terminal computing power by integrating idle resources of heterogeneous devices.However,the imbalance between task exec...In the era of the Internet of Things,distributed computing alleviates the problem of insufficient terminal computing power by integrating idle resources of heterogeneous devices.However,the imbalance between task execution delay and node energy consumption,and the scheduling and adaptation challenges brought about by device heterogeneity,urgently need to be addressed.To tackle this problem,this paper constructs a multi-objective real-time task scheduling model that considers task real-time performance,execution delay,system energy consumption,and node interests.The model aims to minimize the delay upper bound and total energy consumption while maximizing system satisfaction.A real-time task scheduling algorithm based on bilateral matching game is proposed.By designing a bidirectional preference mechanism between tasks and computing nodes,combined with a multi-round stable matching strategy,accurate matching between tasks and nodes is achieved.Simulation results show that compared with the baseline scheme,the proposed algorithm significantly reduces the total execution cost,effectively balances the task execution delay and the energy consumption of compute nodes,and takes into account the interests of each network compute node.展开更多
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.展开更多
In this article,a graphic design method for broadband Doherty power amplifier(DPA) is proposed based on the basic principle of impedance matching with the help of Smith chart.The proposed graphic method avoids the com...In this article,a graphic design method for broadband Doherty power amplifier(DPA) is proposed based on the basic principle of impedance matching with the help of Smith chart.The proposed graphic method avoids the complex formula derivation in the traditional amplifier circuit design process,and the design process is more simple and intuitive.Besides,it only takes three steps to build the load modulation network(LMN) of two power amplifiers(PA) of the DPA.Besides,a capacitor is used to replace the parasitic parameters of the transistor,and the LMN designed in the two modes is used for exploration and comparison.Further more,the output impedance of the peaking PA is introduced to make the reflection coefficient trajectory on Smith chart lowfrequency dispersion so as to expand the bandwidth of the DPA at the output power back-off(OBO) level.It would not affect the performance of DPA in the saturation(SAT) state.In this way,a broadband DPA can be implemented easily.To validate the proposed design method,a broadband DPA operating from 1.9to 2.6 GHz is designed and measured based on the proposed method.Under the continuous-wave excitation,the fabricated DPA has a 6 dB OBO efficiency of 48%-56% and a SAT efficiency of 64%-73% from 1.75 to 2.45 GHz,and the peak output power is 48.9-49.8 dBm.展开更多
Carbon Capture,Utilization,and Storage(CCUS)technology has gained widespread attention in recent years as a critical strategy to combat global climate change,particularly in achieving carbon neutrality goals.The Guang...Carbon Capture,Utilization,and Storage(CCUS)technology has gained widespread attention in recent years as a critical strategy to combat global climate change,particularly in achieving carbon neutrality goals.The Guangdong-Hong Kong-Macao Greater Bay Area(GBA),as one of China's most economically active regions,serves as a key engine for economic growth while also facing considerable carbon emission challenges.This study analyzes the industrial emission volume and geographical distribution of key emitting enterprises in the GBA,summarizes their technological processes and main carbonemitting equipment,and provides scientific support for precise mitigation policies and low-carbon development.Based on data from 176 key emitting enterprises,the study reveals that Guangzhou and Dongguan host the largest number of such enterprises.Carbon emissions are primarily concentrated in the power sector,dominated by coal-and gas-fired power units,characterized by significant spatial dispersion and uneven distribution.Beyond the power sector,the paper industry has a high number of enterprises but lower emissions.Key facilities such as boilers,cogeneration systems,and production lines are predominantly located near tributaries rivers in Dongguan and Jiangmen.The building materials sector,primarily cement production,ranks as the second-largest emitter,with hightemperature kilns and grinding equipment,particularly rotary kilns and glass furnaces,as the main sources.The petrochemical and chemical sectors have fewer enterprises and lower emissions in the GBA,mainly located in suburban industrial clusters.Carbon emissions in the GBA exhibit distinct industry concentration and geographical distribution disparities.This study provides crucial data and theoretical insights for the development of targeted emission reduction strategies,optimization of source-sink matching,and the advancement of CCUS technologies in the region,particularly from the GBA to the northern South China Sea.展开更多
With the increasing use of passive seismic data,developing seismic reflection imaging methods based on passive data is of considerable practical significance.This study presents a waveform-matching reverse time migrat...With the increasing use of passive seismic data,developing seismic reflection imaging methods based on passive data is of considerable practical significance.This study presents a waveform-matching reverse time migration for the primary reflected data from local earthquakes.In order to mitigate inconsistencies in frequency band and energy across earthquakes of different magnitudes,we first establish reference seismic waveform with standardized dominant frequency and magnitude.A matching operator is derived for each event by matching its waveforms with the reference waveform.This operator is then applied via convolution to all waveforms,producing standardized seismic waveforms with consistent wavelet features.The reshaped waveforms are then subjected to reverse time migration using an impedance imaging condition for primary reflections.To suppress strong energy interference near the hypocenters,both illumination compensation and three-dimensional Smoothed Spherical Mask centered on each source are used.Numerical tests using both simple two-layer model and fault-containing model demonstrate that the new method is robust and effective.The reverse time migration of primary reflected data of local earthquakes accurately images underground impedance boundaries such as stratum interfaces and fault planes,showing its promise for future application in seismically active fault zones.展开更多
The demand for high-temperature electromagnetic wave absorption(EWA)materials has significantly increased alongside advancements in aerospace and communication technologies.Although traditional magnetic absorbers,such...The demand for high-temperature electromagnetic wave absorption(EWA)materials has significantly increased alongside advancements in aerospace and communication technologies.Although traditional magnetic absorbers,such as ferrites and metal powders,show excellent magnetic loss performance at room temperature,they have significant limitations in harsh environments due to their high density,low Curie temperature,and susceptibility to oxidation.In contrast,carbon-containing materials have emerged as promising candidates for high-temperature EWA applications,owing to their high melting point,low density,tunable dielectric loss mechanisms,and superior thermal stability.Unlike magnetic materials,carbon-based systems primarily dissipate electromagnetic energy through conductance loss,dipole polarization,and interfacial polarization,thereby avoiding performance degradation at elevated temperatures.However,several critical challenges remain,including insufficient oxidation resistance,mechanical reliability issues,and the need for stable impedance matching.To address these limitations,recent strategies such as defect engineering,heterointerface construction,and metamaterial design have been proposed to enhance thermal stability and functional performance.This review provides a systematic summary of recent advances in carbon-containing absorbers,with a focus on dielectric loss mechanisms,optimization strategies,and multiscale structural design principles.By elucidating the structure–property relationships of carbon materials,carbide ceramics,and novel carbon hybrids,this study aims to offer theoretical and technical guidance for the development of advanced high-temperature electromagnetic wave absorbers,thereby promoting their practical applications in aerospace and telecommunications.展开更多
基金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 in part by the National Natural Science Foundation of China(No.42271446)in part by the Tianjin Key Laboratory of Rail Transit Navigation Positioning and Spatio-Temporary Big Data Technology,China(No.TKL2024B13)in part by the Science and Technology Program of Tianjin,China(No.24YFYSHZ00080)。
文摘The selection of a suitable navigation area is pivotal in aircraft scene matching guidance technology.This study addresses the challenge of identifying suitable reference image ranges for precise scene matching,which is crucial for enhancing aircraft positioning accuracy.Traditional methods for image matchability analysis are often limited by their reliance on manual feature parameter design and threshold-based filtering,resulting in suboptimal accuracy and efficiency.This paper proposes a novel network architecture for selecting suitable navigation areas using image Matching Level Segmentation(MLSNet).The approach involves two key innovations:a method for generating segmentation labels that quantify matchability levels and an end-to-end network architecture for rapid and precise prediction of reference image matchability segmentation maps.The network includes two core modules:the saliency analysis module uses multi-layer convolutional networks to accurately detect image saliency features across various levels and scales;the multidimensional attention module utilizes attention mechanisms to focus on feature channels and spatial neighborhood scenes to assess the image’s matchability.Our method was rigorously tested on an extensive collection of remote sensing images,where it was benchmarked against a range of both traditional and cutting-edge deep learning methods.The findings indicate that MLSNet is significantly superior to traditional methods in accuracy and efficiency of matchability analysis,and is also relatively ahead of state-of-the-art deep learning models.
基金supported by the Spanish Ministry of ScienceInnovation and Universities(MCIN/AEI/10.13039/501100011033,grant number:RYC2019-027216-I)by ESF Investing in your future。
文摘Many bird species are known to differ in their vocal repertoires between populations across a range of geographic scales.This is generally assumed to be caused by acoustic drift and social learning of small differences in songs among individuals in separate populations.To determine the extent to which vocal repertoire is structured in a highly nomadic species with a low degree of isolation among populations,we characterized the vocalizations of the'Apapane(Himatione sanguinea)and described the variations in its songs on a microgeographic scale.'Apapane had significant shifts in their songs in both fragmented and non-fragmented forest habitats,with little to no overlap in song meme structure within distances as short as 2 km,despite birds moving freely between areas with distinct songs.Forest fragments had unique song compositions and shared more syllables with closer fragments than with the ones further apart.Furthermore,microgeographic variation was relatively stable at a given recording location even over multiple years.This pattern of song differentiation in a highly mobile species at the microgeographic scale may be a consequence of their ability to learn new vocalizations over their life and of intraspecific mimicry,or“vocal matching”by individuals visiting other populations.
文摘Internet of Things(IoT)interconnects devices via network protocols to enable intelligent sensing and control.Resource-constrained IoT devices rely on cloud servers for data storage and processing.However,this cloudassisted architecture faces two critical challenges:the untrusted cloud services and the separation of data ownership from control.Although Attribute-based Searchable Encryption(ABSE)provides fine-grained access control and keyword search over encrypted data,existing schemes lack of error tolerance in exact multi-keyword matching.In this paper,we proposed an attribute-based multi-keyword fuzzy searchable encryption with forward ciphertext search(FCS-ABMSE)scheme that avoids computationally expensive bilinear pairing operations on the IoT device side.The scheme supportsmulti-keyword fuzzy search without requiring explicit keyword fields,thereby significantly enhancing error tolerance in search operations.It further incorporates forward-secure ciphertext search to mitigate trapdoor abuse,as well as offline encryption and verifiable outsourced decryption to minimize user-side computational costs.Formal security analysis proved that the FCS-ABMSE scheme meets both indistinguishability of ciphertext under the chosen keyword attacks(IND-CKA)and the indistinguishability of ciphertext under the chosen plaintext attacks(IND-CPA).In addition,we constructed an enhanced variant based on type-3 pairings.Results demonstrated that the proposed scheme outperforms existing ABSE approaches in terms of functionalities,computational cost,and communication cost.
基金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 Program on Key Basic Research Project(2020YFA0713600)the National Natural Science Foundation of China(62272214)。
文摘In the era of the Internet of Things,distributed computing alleviates the problem of insufficient terminal computing power by integrating idle resources of heterogeneous devices.However,the imbalance between task execution delay and node energy consumption,and the scheduling and adaptation challenges brought about by device heterogeneity,urgently need to be addressed.To tackle this problem,this paper constructs a multi-objective real-time task scheduling model that considers task real-time performance,execution delay,system energy consumption,and node interests.The model aims to minimize the delay upper bound and total energy consumption while maximizing system satisfaction.A real-time task scheduling algorithm based on bilateral matching game is proposed.By designing a bidirectional preference mechanism between tasks and computing nodes,combined with a multi-round stable matching strategy,accurate matching between tasks and nodes is achieved.Simulation results show that compared with the baseline scheme,the proposed algorithm significantly reduces the total execution cost,effectively balances the task execution delay and the energy consumption of compute nodes,and takes into account the interests of each network compute node.
文摘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.
基金National Natural Science Foundation of China (No. 62001061)。
文摘In this article,a graphic design method for broadband Doherty power amplifier(DPA) is proposed based on the basic principle of impedance matching with the help of Smith chart.The proposed graphic method avoids the complex formula derivation in the traditional amplifier circuit design process,and the design process is more simple and intuitive.Besides,it only takes three steps to build the load modulation network(LMN) of two power amplifiers(PA) of the DPA.Besides,a capacitor is used to replace the parasitic parameters of the transistor,and the LMN designed in the two modes is used for exploration and comparison.Further more,the output impedance of the peaking PA is introduced to make the reflection coefficient trajectory on Smith chart lowfrequency dispersion so as to expand the bandwidth of the DPA at the output power back-off(OBO) level.It would not affect the performance of DPA in the saturation(SAT) state.In this way,a broadband DPA can be implemented easily.To validate the proposed design method,a broadband DPA operating from 1.9to 2.6 GHz is designed and measured based on the proposed method.Under the continuous-wave excitation,the fabricated DPA has a 6 dB OBO efficiency of 48%-56% and a SAT efficiency of 64%-73% from 1.75 to 2.45 GHz,and the peak output power is 48.9-49.8 dBm.
基金supported by the National Natural Science Foundation of China(52304098,52106092,42376215,52474105)Shenzhen Science and Technology Program(JCYJ20220818095605012,JCYJ20220530113011027)+5 种基金Guangdong Basic and Applied Basic Research Foundation(2022A1515110338,2023A1515012316,2023A1515012761,2025A1515010748)Research Team Cultivation Program of Shenzhen University(2023QNT004)Shenzhen Key Laboratory of Natural Gas Hydrates(ZDSYS20200421111201738)the General Research Fund(No.12616222)Early Career Scheme(No.22611624)of Hong Kong Research Grants CouncilMajor Science and Technology Infrastructure Project of Material Genome Big–science Facilities Platform supported by the Municipal Development and Reform Commission of Shenzhen。
文摘Carbon Capture,Utilization,and Storage(CCUS)technology has gained widespread attention in recent years as a critical strategy to combat global climate change,particularly in achieving carbon neutrality goals.The Guangdong-Hong Kong-Macao Greater Bay Area(GBA),as one of China's most economically active regions,serves as a key engine for economic growth while also facing considerable carbon emission challenges.This study analyzes the industrial emission volume and geographical distribution of key emitting enterprises in the GBA,summarizes their technological processes and main carbonemitting equipment,and provides scientific support for precise mitigation policies and low-carbon development.Based on data from 176 key emitting enterprises,the study reveals that Guangzhou and Dongguan host the largest number of such enterprises.Carbon emissions are primarily concentrated in the power sector,dominated by coal-and gas-fired power units,characterized by significant spatial dispersion and uneven distribution.Beyond the power sector,the paper industry has a high number of enterprises but lower emissions.Key facilities such as boilers,cogeneration systems,and production lines are predominantly located near tributaries rivers in Dongguan and Jiangmen.The building materials sector,primarily cement production,ranks as the second-largest emitter,with hightemperature kilns and grinding equipment,particularly rotary kilns and glass furnaces,as the main sources.The petrochemical and chemical sectors have fewer enterprises and lower emissions in the GBA,mainly located in suburban industrial clusters.Carbon emissions in the GBA exhibit distinct industry concentration and geographical distribution disparities.This study provides crucial data and theoretical insights for the development of targeted emission reduction strategies,optimization of source-sink matching,and the advancement of CCUS technologies in the region,particularly from the GBA to the northern South China Sea.
基金supported by the National Key Research and Development Program of China(No.2020YFA 0710601)the Deep Earth Probe and Mineral Resources Exploration—National Science and Technology Major Project(No.2025ZD1004901).
文摘With the increasing use of passive seismic data,developing seismic reflection imaging methods based on passive data is of considerable practical significance.This study presents a waveform-matching reverse time migration for the primary reflected data from local earthquakes.In order to mitigate inconsistencies in frequency band and energy across earthquakes of different magnitudes,we first establish reference seismic waveform with standardized dominant frequency and magnitude.A matching operator is derived for each event by matching its waveforms with the reference waveform.This operator is then applied via convolution to all waveforms,producing standardized seismic waveforms with consistent wavelet features.The reshaped waveforms are then subjected to reverse time migration using an impedance imaging condition for primary reflections.To suppress strong energy interference near the hypocenters,both illumination compensation and three-dimensional Smoothed Spherical Mask centered on each source are used.Numerical tests using both simple two-layer model and fault-containing model demonstrate that the new method is robust and effective.The reverse time migration of primary reflected data of local earthquakes accurately images underground impedance boundaries such as stratum interfaces and fault planes,showing its promise for future application in seismically active fault zones.
基金supported by the National Natural Science Foundation of China(52572086 and 52502371)the Natural Science Foundation of Henan(242300421010)+2 种基金Scientific and Technological Innovation Talents in Colleges and Universities in Henan Province(22HASTIT001)the Henan Province Natural Science Foundation Outstanding Youth Fund Project(242300421009)the Henan Province science and technology research project(252102320354and 252102230037)。
文摘The demand for high-temperature electromagnetic wave absorption(EWA)materials has significantly increased alongside advancements in aerospace and communication technologies.Although traditional magnetic absorbers,such as ferrites and metal powders,show excellent magnetic loss performance at room temperature,they have significant limitations in harsh environments due to their high density,low Curie temperature,and susceptibility to oxidation.In contrast,carbon-containing materials have emerged as promising candidates for high-temperature EWA applications,owing to their high melting point,low density,tunable dielectric loss mechanisms,and superior thermal stability.Unlike magnetic materials,carbon-based systems primarily dissipate electromagnetic energy through conductance loss,dipole polarization,and interfacial polarization,thereby avoiding performance degradation at elevated temperatures.However,several critical challenges remain,including insufficient oxidation resistance,mechanical reliability issues,and the need for stable impedance matching.To address these limitations,recent strategies such as defect engineering,heterointerface construction,and metamaterial design have been proposed to enhance thermal stability and functional performance.This review provides a systematic summary of recent advances in carbon-containing absorbers,with a focus on dielectric loss mechanisms,optimization strategies,and multiscale structural design principles.By elucidating the structure–property relationships of carbon materials,carbide ceramics,and novel carbon hybrids,this study aims to offer theoretical and technical guidance for the development of advanced high-temperature electromagnetic wave absorbers,thereby promoting their practical applications in aerospace and telecommunications.
