In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the average degree and the average path length of edge vertices of China aviation netwo...In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the average degree and the average path length of edge vertices of China aviation network in 1988,1994,2001,2008 and 2015 was studied.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network.On the basis of the statistical data,the average degree and average path length of edge vertices of China aviation network in 1988,1994,2001,2008 and 2015 were calculated.Through regression analysis,it was found that the average degree had a logarithmic relationship with the average path length of edge vertices and the two parameters of the logarithmic relationship had linear evolutionary trace.展开更多
Factors for determining the spindle size are the shaft diameter, positions of bearing and motor, and entire length of the spindle. Then, it is important to find the assembling of the optimal design variables, which sa...Factors for determining the spindle size are the shaft diameter, positions of bearing and motor, and entire length of the spindle. Then, it is important to find the assembling of the optimal design variables, which satisfy the stiffimss and rotational speed required to the spindle. A general full factorial design method was used to verify some factors that affect the natural frequency of a spindle. It is verified that the shorter shaft length and bearing span length represent the higher natural frequency, and there are some effects according to the change in the levels of factors. The detailed spindle dimension is determined by applying an EVD method, which can define the optimal bearing position through considering the limiting condition. Based on the estimated regression model, the optimal spindle size and bearing distance that can improve the primary natural frequency are obtained, and the influence of design factors on the natural frequency is also analyzed.展开更多
Isomorphism detection is fundamental to the synthesis and innovative design of kinematic chains(KCs).The detection can be performed accurately by using the similarity of KCs.However,there are very few works on isomorp...Isomorphism detection is fundamental to the synthesis and innovative design of kinematic chains(KCs).The detection can be performed accurately by using the similarity of KCs.However,there are very few works on isomorphism detection based on the properties of similar vertices.In this paper,an ameliorated multi-order adjacent vertex assignment sequence(AMAVS)method is proposed to seek out similar vertices and identify the isomorphism of the planar KCs.First,the specific definition of AMAVS is described.Through the calculation of the AMAVS,the adjacent vertex value sequence reflecting the uniqueness of the topology features is established.Based on the value sequence,all possible similar vertices,corresponding relations,and isomorphism discrimination can be realized.By checking the topological graph of KCs with a different number of links,the effectiveness and efficiency of the proposed method are verified.Finally,the method is employed to implement the similar vertices and isomorphism detection of all the 9-link 2-D0F(degree of freedom)planar KCs.展开更多
Two kinds of unconnected double fan graphs with even vertices,(P^((1))_(1)∨(P^((1))_(2n)∪P^((2))_(2n)))∪P_(2n+1)∪(P_(1)^((2))∨K_(2n))and(P_(1)^((1))∨(P^((1))_(2n)∪P^((2))_(2n)))∪(P_(1)^((2))∨K_((1))^(2n))∪(P...Two kinds of unconnected double fan graphs with even vertices,(P^((1))_(1)∨(P^((1))_(2n)∪P^((2))_(2n)))∪P_(2n+1)∪(P_(1)^((2))∨K_(2n))and(P_(1)^((1))∨(P^((1))_(2n)∪P^((2))_(2n)))∪(P_(1)^((2))∨K_((1))^(2n))∪(P^((3))_(1)∨K_((2))^(2n))were presented.For natural number n∈N,n≥1,the two graphs are all graceful graphs,where P^((1))_(2n),P^((2))_(2n)are even-vertices path,P_(2n+1)is odd-vertices path,K_(2n),K^((1))_(2n),K^((2))_(2n)are the complement of graph K_(2 n),G_(1)∨G_(2)is the join graph of G_(1)and G_(2).展开更多
The quantum search on the graph is a very important topic.In this work,we develop a theoretic method on searching of single vertex on the graph[Phys.Rev.Lett.114110503(2015)],and systematically study the search of man...The quantum search on the graph is a very important topic.In this work,we develop a theoretic method on searching of single vertex on the graph[Phys.Rev.Lett.114110503(2015)],and systematically study the search of many vertices on one low-connectivity graph,the joined complete graph.Our results reveal that,with the optimal jumping rate obtained from the theoretical method,we can find such target vertices at the time O(√N),where N is the number of total vertices.Therefore,the search of many vertices on the joined complete graph possessing quantum advantage has been achieved.展开更多
Let G be a graph of order n with vertex set V(G) = {v1, v2,…, vn}. the adjacency matrix of G is an n × n matrix A(G) = (aij)n×n, where aij is the number edges joining vi and vj in G. The eigenvalues λ1, λ...Let G be a graph of order n with vertex set V(G) = {v1, v2,…, vn}. the adjacency matrix of G is an n × n matrix A(G) = (aij)n×n, where aij is the number edges joining vi and vj in G. The eigenvalues λ1, λ2, λ3,…, λn, of A(G) are said to be the eigenvalues of the graph G and to form the spectrum of this graph. The number of nonzero eigenvalues and zero eigenvalues in the spectrum of G are called rank and nullity of the graph G, and are denoted by r(G) and η(G), respectively. It follows from the definitions that r(G) + η(G) = n. In this paper, by using the operation of multiplication of vertices, a characterization for graph G with pendant vertices and r(G) = 7 is shown, and then a characterization for graph G with pendant vertices and r(G) less than or equal to 7 is shown.展开更多
Based on the rainbow-ladder approximation of the Dyson-Schwinger equations and the assumption of the analyticity of the fermion-boson vertex in the neighborhood of zero chemical potential （μ = 0） and neglecting the...Based on the rainbow-ladder approximation of the Dyson-Schwinger equations and the assumption of the analyticity of the fermion-boson vertex in the neighborhood of zero chemical potential （μ = 0） and neglecting the #-dependence of the dressed gluon propagator, we apply the method in [Phys. Rev. C 71 （2005） 015205] of studying the dressed quark propagator at finite chemical potential to prove that the general fermion-boson vertex at finite μ can also be obtained from the one at μ = 0 by a simple shift of variables. Using this result we extend the results of [Phys. Lett. B 420 （1998） 267] to the situation of finite chemical potential and show that under the approximations we have taken, the Gell-Mann Oakes-Renner relation also holds at finite chemical potential展开更多
In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of average degree of edge vertices of China aviation network w...In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of average degree of edge vertices of China aviation network were studied based on the statistics data of China civil aviation network in 1988, 1994, 2001, 2008 and 2015. According to the theory and method of complex network, the network system was constructed with the city where the airport was located as the network node and the route between cities as the edge of the network. Based on the statistical data, the average degrees of edge vertices in China aviation network in 1988, 1994, 2001, 2008 and 2015 were calculated. Using the probability statistical analysis method and regression analysis approach, it was found that the average degree of edge vertices had the probability distribution of normal function and the position parameters and scale parameters of the probability distribution had linear evolution trace.展开更多
In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of ratio of China aviation network edge vertices degree were s...In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of ratio of China aviation network edge vertices degree were studied based on the statistics data of China civil aviation network in 1988, 1994, 2001, 2008 and 2015. According to the theory and method of complex network, the network system was constructed with the city where the airport was located as the network node and the route between cities as the edge of the network. Based on the statistical data, the ratio of edge vertices degree in China aviation network in 1988, 1994, 2001, 2008 and 2015 were calculated. Using the probability statistical analysis method and regression analysis approach, it was found that the ratio of edge vertices degree had linear probability distribution and the two parameters of the probability distribution had linear evolution trace.展开更多
In order to reveal the complex network characteristics and evolution principle of China aviation network,the probability distribution and evolution trace of arithmetic average of edge vertices nearest neighbor average...In order to reveal the complex network characteristics and evolution principle of China aviation network,the probability distribution and evolution trace of arithmetic average of edge vertices nearest neighbor average degree values of China aviation network were studied based on the statistics data of China civil aviation network in 1988,1994,2001,2008 and 2015.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the route between cities as the edge of the network.Based on the statistical data,the arithmetic averages of edge vertices nearest neighbor average degree values of China aviation network in 1988,1994,2001,2008 and 2015 were calculated.Using the probability statistical analysis method,it was found that the arithmetic average of edge vertices nearest neighbor average degree values had the probability distribution of normal function and the position parameters and scale parameters of the probability distribution had linear evolution trace.展开更多
Let S(m,d,k)be the set of k-uniform supertrees with m edges and diameter d,and S1(m,d,k)be the k-uniform supertree obtained from a loose path u_(1),e_(1),u_(2),e_(2),...,u_(d),e_(d),u_(d+1),with length d by attaching ...Let S(m,d,k)be the set of k-uniform supertrees with m edges and diameter d,and S1(m,d,k)be the k-uniform supertree obtained from a loose path u_(1),e_(1),u_(2),e_(2),...,u_(d),e_(d),u_(d+1),with length d by attaching m-d edges at vertex u_[d/2]+1.In this paper,we mainly determine S1(m,d,k)with the largest signless Laplacian spectral radius in S(m,d,k)for 3≤d≤m-1.We also determine the supertree with the second largest signless Laplacian spectral radius in S(m,3,k).Furthermore,we determine the unique/c-uniform supertree with the largest signless Laplacian spectral radius among all fc-uniform supertrees with n vertices and pendent edges(vertices).展开更多
A k-tree is a tree with maximum degree at most k. In this paper, we give a sharp degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than t, where 1≤t≤k.We denote ...A k-tree is a tree with maximum degree at most k. In this paper, we give a sharp degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than t, where 1≤t≤k.We denote by σ_k(G) the minimum value of the degree sum of k independent vertices in a graph G. Let k≥2,s≥0 and 1≤t≤k be integers, and suppose G is an(s + 1)-connected graph with σ_k(G)≥|G|+(k-t)s-1.Then for any s specified vertices, G contains a spanning k-tree in which every specified vertex has degree at most t. This improves a result obtained by Matsuda and Matsumura.展开更多
Chiral nanoporous nanoarchitectures exhibit potential applications in various fields including chiral separation,sensing and catalysis.Two-dimensional(2D)supramolecular chemistry offers novel methods to build chiral n...Chiral nanoporous nanoarchitectures exhibit potential applications in various fields including chiral separation,sensing and catalysis.Two-dimensional(2D)supramolecular chemistry offers novel methods to build chiral nanoporous networks from achiral molecules.Herein,we report a series of chiral nanoporous networks built by an achiral precursor molecule via a stepwise annealing strategy on Ag(100).The nanoporous network morphologies and structural details are characterized by high-resolution scanning tunneling microscopy(STM).It is revealed that all vertices within networks are chiral.These chiral vertices are either dimeric,trimeric,or tetrameric.The connection of these chiral vertices gives rise to diverse chiral nanopores with varying shapes and sizes.A strict chirality correlation between nanopores and their vertices is determined.Specifically,enantiomeric vertices of one-pair nanopore enantiomers are always in identical type but opposite handedness.This work serves as a model to investigate the influence of vertex chirality on nanopore chirality of a supramolecular matrix.The attained chiral nanopores could potentially be utilized as templates for surface reaction,chiral recognition,etc.The mirror-symmetric silver adatoms clusters dictated by chiral nanopore are discerned.展开更多
Schuster, Cai Maocheng and Lin Yixun studied the interpolation theory for the number of end vertices of spanning trees of graph. Zhang Fuji and Guo Xiaofeng obtained the related result of digraph. This paper is devote...Schuster, Cai Maocheng and Lin Yixun studied the interpolation theory for the number of end vertices of spanning trees of graph. Zhang Fuji and Guo Xiaofeng obtained the related result of digraph. This paper is devoted to find the upper and lower bounds of the maximum number of end vertices of spanning (directed) trees for directed or undirected graphs. Our result is connected with some parameters in graph theory such as cyclomatic number and absorption number. For our purpose,展开更多
This study investigates the relationship between atmospheric stratification (i.e., static stability given by N^(2)) and the vertical energy transfer of stationary planetary waves, and further illustrates the underlyin...This study investigates the relationship between atmospheric stratification (i.e., static stability given by N^(2)) and the vertical energy transfer of stationary planetary waves, and further illustrates the underlying physical mechanism. Specifically, for the simplified case of constant stratospheric N^(2), the refractive index square of planetary waves has a theoretical tendency to increase first and then decrease with an increased N^(2), whereas the group velocity weakens. Mechanistically, this behavior can be understood as an intensified suppression of vertical isentropic surface displacement caused by meridional heat transport of planetary waves under strong N^(2) conditions. Observational analysis corroborates this finding, demonstrating a reduction in the vertical-propagation velocity of waves with increased N^(2). A linear, quasi- geostrophic, mid-latitude beta-plane model with a constant background westerly wind and a prescribed N^(2) applicable to the stratosphere is used to obtain analytic solutions. In this model, the planetary waves are initiated by steady energy influx from the lower boundary. The analysis indicates that under strong N^(2) conditions, the amplitude of planetary waves can be sufficiently increased by the effective energy convergence due to the slowing vertical energy transfer, resulting in a streamfunction response in this model that contains more energy. For N^(2) with a quasi-linear vertical variation, the results bear a resemblance to the constant case, except that the wave amplitude and oscillating frequency show some vertical variations.展开更多
An invariant σ2（G） of a graph is defined as follows： σ2（G） ：= min{d（u） ＋ d（v）｜u, v ∈V（G）,uv ∈ E（G）,u ≠ v} is the minimum degree sum of nonadjacent vertices （when G is a complete graph, we define ...An invariant σ2（G） of a graph is defined as follows： σ2（G） ：= min{d（u） ＋ d（v）｜u, v ∈V（G）,uv ∈ E（G）,u ≠ v} is the minimum degree sum of nonadjacent vertices （when G is a complete graph, we define σ2（G） = ∞）. Let k, s be integers with k ≥ 2 and s ≥ 4, G be a graph of order n sufficiently large compared with s and k. We show that if σ2（G） ≥ n ＋ k- 1, then for any set of k independent vertices v1,..., vk, G has k vertex-disjoint cycles C1,..., Ck such that ｜Ci｜ ≤ s and vi ∈ V（Ci） for all 1 ≤ i ≤ k. The condition of degree sum σs（G） ≥ n ＋ k - 1 is sharp.展开更多
This study investigates the width of the secondary eyewall(SE)immediately following its formation in tropical cyclones with surface environmental winds aligned and counter-aligned with environmental vertical wind shea...This study investigates the width of the secondary eyewall(SE)immediately following its formation in tropical cyclones with surface environmental winds aligned and counter-aligned with environmental vertical wind shear(VWS),using idealized numerical experiments.Results reveal that the SE develops greater radial extent when surface winds align with VWS compared to counter-aligned conditions.In alignment configurations,shear-enhanced surface winds on the right flank amplify surface enthalpy fluxes,thereby elevating boundary-layer entropy within the downshear outer-core region.Subsequently,more vigorous outer rainbands develop,inducing marked acceleration of tangential winds in the outer core preceding SE formation.The resultant radial expansion of supergradient winds near the boundary-layer top triggers widespread convective activity immediately beyond the inner core.Progressive axisymmetrization of this convective forcing ultimately generates an expansive SE structure.展开更多
In the realm of Intelligent Railway Transportation Systems,effective multi-party collaboration is crucial due to concerns over privacy and data silos.Vertical Federated Learning(VFL)has emerged as a promising approach...In the realm of Intelligent Railway Transportation Systems,effective multi-party collaboration is crucial due to concerns over privacy and data silos.Vertical Federated Learning(VFL)has emerged as a promising approach to facilitate such collaboration,allowing diverse entities to collectively enhance machine learning models without the need to share sensitive training data.However,existing works have highlighted VFL’s susceptibility to privacy inference attacks,where an honest but curious server could potentially reconstruct a client’s raw data from embeddings uploaded by the client.This vulnerability poses a significant threat to VFL-based intelligent railway transportation systems.In this paper,we introduce SensFL,a novel privacy-enhancing method to against privacy inference attacks in VFL.Specifically,SensFL integrates regularization of the sensitivity of embeddings to the original data into the model training process,effectively limiting the information contained in shared embeddings.By reducing the sensitivity of embeddings to the original data,SensFL can effectively resist reverse privacy attacks and prevent the reconstruction of the original data from the embeddings.Extensive experiments were conducted on four distinct datasets and three different models to demonstrate the efficacy of SensFL.Experiment results show that SensFL can effectively mitigate privacy inference attacks while maintaining the accuracy of the primary learning task.These results underscore SensFL’s potential to advance privacy protection technologies within VFL-based intelligent railway systems,addressing critical security concerns in collaborative learning environments.展开更多
Rice(Oryza sativa L.)plays a pivotal role in global food security,yet its breeding is constrained by its long generation time and seasonality.To enhance rice breeding efficiency and meet future food demands,we have de...Rice(Oryza sativa L.)plays a pivotal role in global food security,yet its breeding is constrained by its long generation time and seasonality.To enhance rice breeding efficiency and meet future food demands,we have developed a vertical hydroponic breeding system integrated with light-emitting diodes(LEDs)light-ing in a closed plant factory(PF),which significantly accelerates rice growth and generation advance-ment.The results show that indica rice can be harvested as early as after 63 days of cultivation,a 50%reduction compared with field cultivation,enabling the annual harvesting of 5-6 generations within the PF.A hyperspectral imaging(HSI)system and attenuated total reflectance infrared(ATR-IR)spec-troscopy were further employed to characterize the chemical composition of the PF-and field-cultivated rice.Metabolomics analysis with ultra-performance liquid chromatography-tandem mass spectrometry(UPLC-MS/MS)and gas chromatography-mass spectrometry(GC-MS)revealed that,com-pared with the field-cultivated rice,the PF-cultivated rice exhibited an up-regulation of total phenolic acids along with 68 non-volatile and 19 volatile metabolites,such as isovitexin,succinic acid,and methylillicinone F.Overall,this study reveals the unique metabolic profile of PF-cultivated rice and high-lights the potential of PFs to accelerate the breeding of crops such as rice,offering an innovative agricul-tural strategy to support food security in the face of global population growth and climate change.展开更多
To improve the vertical axis wind turbine(VAWT)design,the angle of attack(AOA)and airfoil data must be treated correctly.The present paper develops a method for determining AOA on a VAWT based on computational fluid d...To improve the vertical axis wind turbine(VAWT)design,the angle of attack(AOA)and airfoil data must be treated correctly.The present paper develops a method for determining AOA on a VAWT based on computational fluid dynamics(CFD)analysis.First,a CFD analysis of a two-bladed VAWT equipped with a NACA 0012 airfoil is conducted.The thrust and power coefficients are validated through experiments.Second,the blade force and velocity data at monitoring points are collected.The AOA at different azimuth angles is determined by removing the blade self-induction at the monitoring point.Then,the lift and drag coefficients as a function of AOA are extracted.Results show that this method is independent of the monitoring points selection located at certain distance to the blades and the extracted dynamic stall hysteresis is more precise than the one with the“usual”method without considering the self-induction from bound vortices.展开更多
文摘In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the average degree and the average path length of edge vertices of China aviation network in 1988,1994,2001,2008 and 2015 was studied.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network.On the basis of the statistical data,the average degree and average path length of edge vertices of China aviation network in 1988,1994,2001,2008 and 2015 were calculated.Through regression analysis,it was found that the average degree had a logarithmic relationship with the average path length of edge vertices and the two parameters of the logarithmic relationship had linear evolutionary trace.
基金Project(RTI04-01-03) supported by the Regional Technology Innovation Program of the Ministry of Knowledge Economy (MKE) of Korea
文摘Factors for determining the spindle size are the shaft diameter, positions of bearing and motor, and entire length of the spindle. Then, it is important to find the assembling of the optimal design variables, which satisfy the stiffimss and rotational speed required to the spindle. A general full factorial design method was used to verify some factors that affect the natural frequency of a spindle. It is verified that the shorter shaft length and bearing span length represent the higher natural frequency, and there are some effects according to the change in the levels of factors. The detailed spindle dimension is determined by applying an EVD method, which can define the optimal bearing position through considering the limiting condition. Based on the estimated regression model, the optimal spindle size and bearing distance that can improve the primary natural frequency are obtained, and the influence of design factors on the natural frequency is also analyzed.
基金Supported by National Natural Science Foundation of China(Grant Nos.51675488,51975534)Zhejiang Provincial Natural Science Foundation of China(Grant No.LY19E050021)。
文摘Isomorphism detection is fundamental to the synthesis and innovative design of kinematic chains(KCs).The detection can be performed accurately by using the similarity of KCs.However,there are very few works on isomorphism detection based on the properties of similar vertices.In this paper,an ameliorated multi-order adjacent vertex assignment sequence(AMAVS)method is proposed to seek out similar vertices and identify the isomorphism of the planar KCs.First,the specific definition of AMAVS is described.Through the calculation of the AMAVS,the adjacent vertex value sequence reflecting the uniqueness of the topology features is established.Based on the value sequence,all possible similar vertices,corresponding relations,and isomorphism discrimination can be realized.By checking the topological graph of KCs with a different number of links,the effectiveness and efficiency of the proposed method are verified.Finally,the method is employed to implement the similar vertices and isomorphism detection of all the 9-link 2-D0F(degree of freedom)planar KCs.
基金the National Natural Science Foundation of China(11702094)the Fundamental Research Funds for the Central University(3142015045)。
文摘Two kinds of unconnected double fan graphs with even vertices,(P^((1))_(1)∨(P^((1))_(2n)∪P^((2))_(2n)))∪P_(2n+1)∪(P_(1)^((2))∨K_(2n))and(P_(1)^((1))∨(P^((1))_(2n)∪P^((2))_(2n)))∪(P_(1)^((2))∨K_((1))^(2n))∪(P^((3))_(1)∨K_((2))^(2n))were presented.For natural number n∈N,n≥1,the two graphs are all graceful graphs,where P^((1))_(2n),P^((2))_(2n)are even-vertices path,P_(2n+1)is odd-vertices path,K_(2n),K^((1))_(2n),K^((2))_(2n)are the complement of graph K_(2 n),G_(1)∨G_(2)is the join graph of G_(1)and G_(2).
基金the National Key R&D Program of China(Grant No.2017YFA0303800)the National Natural Science Foundation of China(Grant Nos.91850205 and 11974046)。
文摘The quantum search on the graph is a very important topic.In this work,we develop a theoretic method on searching of single vertex on the graph[Phys.Rev.Lett.114110503(2015)],and systematically study the search of many vertices on one low-connectivity graph,the joined complete graph.Our results reveal that,with the optimal jumping rate obtained from the theoretical method,we can find such target vertices at the time O(√N),where N is the number of total vertices.Therefore,the search of many vertices on the joined complete graph possessing quantum advantage has been achieved.
文摘Let G be a graph of order n with vertex set V(G) = {v1, v2,…, vn}. the adjacency matrix of G is an n × n matrix A(G) = (aij)n×n, where aij is the number edges joining vi and vj in G. The eigenvalues λ1, λ2, λ3,…, λn, of A(G) are said to be the eigenvalues of the graph G and to form the spectrum of this graph. The number of nonzero eigenvalues and zero eigenvalues in the spectrum of G are called rank and nullity of the graph G, and are denoted by r(G) and η(G), respectively. It follows from the definitions that r(G) + η(G) = n. In this paper, by using the operation of multiplication of vertices, a characterization for graph G with pendant vertices and r(G) = 7 is shown, and then a characterization for graph G with pendant vertices and r(G) less than or equal to 7 is shown.
基金supported in part by National Natural Science Foundation of China under Grant No.10575050the Research Fund for the Doctoral Program of Higher Education under Grant No.20060284020
文摘Based on the rainbow-ladder approximation of the Dyson-Schwinger equations and the assumption of the analyticity of the fermion-boson vertex in the neighborhood of zero chemical potential （μ = 0） and neglecting the #-dependence of the dressed gluon propagator, we apply the method in [Phys. Rev. C 71 （2005） 015205] of studying the dressed quark propagator at finite chemical potential to prove that the general fermion-boson vertex at finite μ can also be obtained from the one at μ = 0 by a simple shift of variables. Using this result we extend the results of [Phys. Lett. B 420 （1998） 267] to the situation of finite chemical potential and show that under the approximations we have taken, the Gell-Mann Oakes-Renner relation also holds at finite chemical potential
文摘In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of average degree of edge vertices of China aviation network were studied based on the statistics data of China civil aviation network in 1988, 1994, 2001, 2008 and 2015. According to the theory and method of complex network, the network system was constructed with the city where the airport was located as the network node and the route between cities as the edge of the network. Based on the statistical data, the average degrees of edge vertices in China aviation network in 1988, 1994, 2001, 2008 and 2015 were calculated. Using the probability statistical analysis method and regression analysis approach, it was found that the average degree of edge vertices had the probability distribution of normal function and the position parameters and scale parameters of the probability distribution had linear evolution trace.
文摘In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of ratio of China aviation network edge vertices degree were studied based on the statistics data of China civil aviation network in 1988, 1994, 2001, 2008 and 2015. According to the theory and method of complex network, the network system was constructed with the city where the airport was located as the network node and the route between cities as the edge of the network. Based on the statistical data, the ratio of edge vertices degree in China aviation network in 1988, 1994, 2001, 2008 and 2015 were calculated. Using the probability statistical analysis method and regression analysis approach, it was found that the ratio of edge vertices degree had linear probability distribution and the two parameters of the probability distribution had linear evolution trace.
文摘In order to reveal the complex network characteristics and evolution principle of China aviation network,the probability distribution and evolution trace of arithmetic average of edge vertices nearest neighbor average degree values of China aviation network were studied based on the statistics data of China civil aviation network in 1988,1994,2001,2008 and 2015.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the route between cities as the edge of the network.Based on the statistical data,the arithmetic averages of edge vertices nearest neighbor average degree values of China aviation network in 1988,1994,2001,2008 and 2015 were calculated.Using the probability statistical analysis method,it was found that the arithmetic average of edge vertices nearest neighbor average degree values had the probability distribution of normal function and the position parameters and scale parameters of the probability distribution had linear evolution trace.
基金supported in part by the National Natural Science Foundation of China(Grant No.11871398)the Natural Science Foundation of Shaanxi Province(Nos.2020JQ-107,2020JQ-696)the Seed Foundation of Innovation and Creation for Graduate Students in Northwestern Polytechnical University(Nos.ZZ2018171,CX2020190).
文摘Let S(m,d,k)be the set of k-uniform supertrees with m edges and diameter d,and S1(m,d,k)be the k-uniform supertree obtained from a loose path u_(1),e_(1),u_(2),e_(2),...,u_(d),e_(d),u_(d+1),with length d by attaching m-d edges at vertex u_[d/2]+1.In this paper,we mainly determine S1(m,d,k)with the largest signless Laplacian spectral radius in S(m,d,k)for 3≤d≤m-1.We also determine the supertree with the second largest signless Laplacian spectral radius in S(m,3,k).Furthermore,we determine the unique/c-uniform supertree with the largest signless Laplacian spectral radius among all fc-uniform supertrees with n vertices and pendent edges(vertices).
基金Partially supported by National Natural Science Foundation of China(No.11771172)key scientific and technological project of higher education of Henan Province(No.19A110019)+1 种基金Science and technology innovation fund of Henan Agricultural University(No.KJCX2019A15)Partially supported by the Ph D Research Foundation of Henan Agricultural University(No.30500614)
文摘A k-tree is a tree with maximum degree at most k. In this paper, we give a sharp degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than t, where 1≤t≤k.We denote by σ_k(G) the minimum value of the degree sum of k independent vertices in a graph G. Let k≥2,s≥0 and 1≤t≤k be integers, and suppose G is an(s + 1)-connected graph with σ_k(G)≥|G|+(k-t)s-1.Then for any s specified vertices, G contains a spanning k-tree in which every specified vertex has degree at most t. This improves a result obtained by Matsuda and Matsumura.
基金This work was financially supported by the National Natural Science Foundation of China(Nos.21773222,U1732272,and U1932214)the National Key R&D Program of China(Nos.2017YFA0403402,2017YFA0403403,and 2019YFA0405601)+1 种基金Users with Excellence Program of Hefei Science Center CAS(No.2020HSC-UE004)the DNL Cooperation Fund,CAS(No.DNL180201).
文摘Chiral nanoporous nanoarchitectures exhibit potential applications in various fields including chiral separation,sensing and catalysis.Two-dimensional(2D)supramolecular chemistry offers novel methods to build chiral nanoporous networks from achiral molecules.Herein,we report a series of chiral nanoporous networks built by an achiral precursor molecule via a stepwise annealing strategy on Ag(100).The nanoporous network morphologies and structural details are characterized by high-resolution scanning tunneling microscopy(STM).It is revealed that all vertices within networks are chiral.These chiral vertices are either dimeric,trimeric,or tetrameric.The connection of these chiral vertices gives rise to diverse chiral nanopores with varying shapes and sizes.A strict chirality correlation between nanopores and their vertices is determined.Specifically,enantiomeric vertices of one-pair nanopore enantiomers are always in identical type but opposite handedness.This work serves as a model to investigate the influence of vertex chirality on nanopore chirality of a supramolecular matrix.The attained chiral nanopores could potentially be utilized as templates for surface reaction,chiral recognition,etc.The mirror-symmetric silver adatoms clusters dictated by chiral nanopore are discerned.
文摘Schuster, Cai Maocheng and Lin Yixun studied the interpolation theory for the number of end vertices of spanning trees of graph. Zhang Fuji and Guo Xiaofeng obtained the related result of digraph. This paper is devoted to find the upper and lower bounds of the maximum number of end vertices of spanning (directed) trees for directed or undirected graphs. Our result is connected with some parameters in graph theory such as cyclomatic number and absorption number. For our purpose,
基金supported by the National Natural Science Foundation of China(Grant No.42261134532,42405059,and U2342212)。
文摘This study investigates the relationship between atmospheric stratification (i.e., static stability given by N^(2)) and the vertical energy transfer of stationary planetary waves, and further illustrates the underlying physical mechanism. Specifically, for the simplified case of constant stratospheric N^(2), the refractive index square of planetary waves has a theoretical tendency to increase first and then decrease with an increased N^(2), whereas the group velocity weakens. Mechanistically, this behavior can be understood as an intensified suppression of vertical isentropic surface displacement caused by meridional heat transport of planetary waves under strong N^(2) conditions. Observational analysis corroborates this finding, demonstrating a reduction in the vertical-propagation velocity of waves with increased N^(2). A linear, quasi- geostrophic, mid-latitude beta-plane model with a constant background westerly wind and a prescribed N^(2) applicable to the stratosphere is used to obtain analytic solutions. In this model, the planetary waves are initiated by steady energy influx from the lower boundary. The analysis indicates that under strong N^(2) conditions, the amplitude of planetary waves can be sufficiently increased by the effective energy convergence due to the slowing vertical energy transfer, resulting in a streamfunction response in this model that contains more energy. For N^(2) with a quasi-linear vertical variation, the results bear a resemblance to the constant case, except that the wave amplitude and oscillating frequency show some vertical variations.
基金Foundation item： the National Natural Science Foundation of China （No. 10626029）.
文摘An invariant σ2（G） of a graph is defined as follows： σ2（G） ：= min{d（u） ＋ d（v）｜u, v ∈V（G）,uv ∈ E（G）,u ≠ v} is the minimum degree sum of nonadjacent vertices （when G is a complete graph, we define σ2（G） = ∞）. Let k, s be integers with k ≥ 2 and s ≥ 4, G be a graph of order n sufficiently large compared with s and k. We show that if σ2（G） ≥ n ＋ k- 1, then for any set of k independent vertices v1,..., vk, G has k vertex-disjoint cycles C1,..., Ck such that ｜Ci｜ ≤ s and vi ∈ V（Ci） for all 1 ≤ i ≤ k. The condition of degree sum σs（G） ≥ n ＋ k - 1 is sharp.
基金jointly supported by the National Natural Science Foundation of China[grant numbers U2342202,42175005,and 42175016]the Qing Lan Project[grant number R2023Q06]。
文摘This study investigates the width of the secondary eyewall(SE)immediately following its formation in tropical cyclones with surface environmental winds aligned and counter-aligned with environmental vertical wind shear(VWS),using idealized numerical experiments.Results reveal that the SE develops greater radial extent when surface winds align with VWS compared to counter-aligned conditions.In alignment configurations,shear-enhanced surface winds on the right flank amplify surface enthalpy fluxes,thereby elevating boundary-layer entropy within the downshear outer-core region.Subsequently,more vigorous outer rainbands develop,inducing marked acceleration of tangential winds in the outer core preceding SE formation.The resultant radial expansion of supergradient winds near the boundary-layer top triggers widespread convective activity immediately beyond the inner core.Progressive axisymmetrization of this convective forcing ultimately generates an expansive SE structure.
基金supported by Systematic Major Project of Shuohuang Railway Development Co.,Ltd.,National Energy Group(Grant Number:SHTL-23-31)Beijing Natural Science Foundation(U22B2027).
文摘In the realm of Intelligent Railway Transportation Systems,effective multi-party collaboration is crucial due to concerns over privacy and data silos.Vertical Federated Learning(VFL)has emerged as a promising approach to facilitate such collaboration,allowing diverse entities to collectively enhance machine learning models without the need to share sensitive training data.However,existing works have highlighted VFL’s susceptibility to privacy inference attacks,where an honest but curious server could potentially reconstruct a client’s raw data from embeddings uploaded by the client.This vulnerability poses a significant threat to VFL-based intelligent railway transportation systems.In this paper,we introduce SensFL,a novel privacy-enhancing method to against privacy inference attacks in VFL.Specifically,SensFL integrates regularization of the sensitivity of embeddings to the original data into the model training process,effectively limiting the information contained in shared embeddings.By reducing the sensitivity of embeddings to the original data,SensFL can effectively resist reverse privacy attacks and prevent the reconstruction of the original data from the embeddings.Extensive experiments were conducted on four distinct datasets and three different models to demonstrate the efficacy of SensFL.Experiment results show that SensFL can effectively mitigate privacy inference attacks while maintaining the accuracy of the primary learning task.These results underscore SensFL’s potential to advance privacy protection technologies within VFL-based intelligent railway systems,addressing critical security concerns in collaborative learning environments.
基金supported by the National Key Research and Development Program(2023YFF1001500)the Local Financial Funds of National Agricultural Science and Technology Center,Chengdu(NASC2022KR02,NASC2023TD08,NASC2021ST08,NASC2021PC04,NASC2022KR07,NASC2022KR06,and NASC2023ST04)+2 种基金the Agricultural Science and Technology Innova-tion Program(ASTIP-34-IUA-01,ASTIP-34-IUA-02,ASTIP-IUA-2023003,and ASTIP2024-34-IUA-09)the Central Public-interest Scientific Institution Basal Research Fund(Y2023YJ07 and SZ202403)the Sichuan Science and Technology Program(2023YFN003,2024NSFC1261,2023YFQ0100,and 2023ZYD0089).
文摘Rice(Oryza sativa L.)plays a pivotal role in global food security,yet its breeding is constrained by its long generation time and seasonality.To enhance rice breeding efficiency and meet future food demands,we have developed a vertical hydroponic breeding system integrated with light-emitting diodes(LEDs)light-ing in a closed plant factory(PF),which significantly accelerates rice growth and generation advance-ment.The results show that indica rice can be harvested as early as after 63 days of cultivation,a 50%reduction compared with field cultivation,enabling the annual harvesting of 5-6 generations within the PF.A hyperspectral imaging(HSI)system and attenuated total reflectance infrared(ATR-IR)spec-troscopy were further employed to characterize the chemical composition of the PF-and field-cultivated rice.Metabolomics analysis with ultra-performance liquid chromatography-tandem mass spectrometry(UPLC-MS/MS)and gas chromatography-mass spectrometry(GC-MS)revealed that,com-pared with the field-cultivated rice,the PF-cultivated rice exhibited an up-regulation of total phenolic acids along with 68 non-volatile and 19 volatile metabolites,such as isovitexin,succinic acid,and methylillicinone F.Overall,this study reveals the unique metabolic profile of PF-cultivated rice and high-lights the potential of PFs to accelerate the breeding of crops such as rice,offering an innovative agricul-tural strategy to support food security in the face of global population growth and climate change.
文摘To improve the vertical axis wind turbine(VAWT)design,the angle of attack(AOA)and airfoil data must be treated correctly.The present paper develops a method for determining AOA on a VAWT based on computational fluid dynamics(CFD)analysis.First,a CFD analysis of a two-bladed VAWT equipped with a NACA 0012 airfoil is conducted.The thrust and power coefficients are validated through experiments.Second,the blade force and velocity data at monitoring points are collected.The AOA at different azimuth angles is determined by removing the blade self-induction at the monitoring point.Then,the lift and drag coefficients as a function of AOA are extracted.Results show that this method is independent of the monitoring points selection located at certain distance to the blades and the extracted dynamic stall hysteresis is more precise than the one with the“usual”method without considering the self-induction from bound vortices.
