Parameterized computation is a new method dealing with NP-hard problems, which has attracted a lot of attentions in theoretical computer science. As a practical preprocessing method for NP-hard problems, kernelizaiton...Parameterized computation is a new method dealing with NP-hard problems, which has attracted a lot of attentions in theoretical computer science. As a practical preprocessing method for NP-hard problems, kernelizaiton in parameterized computation has recently become an active research area. In this paper, we discuss several kernelizaiton techniques, such as crown decomposition, planar graph vertex partition, randomized methods, and kernel lower bounds, which have been used widely in the kernelization of many hard problems.展开更多
This paper presents methods for computing a second-order sensitivity matrix and the Hessian matrix of eigenvalues and eigenvectors of multiple parameter structures. Second-order perturbations of eigenvalues and eigenv...This paper presents methods for computing a second-order sensitivity matrix and the Hessian matrix of eigenvalues and eigenvectors of multiple parameter structures. Second-order perturbations of eigenvalues and eigenvectors are transformed into multiple parameter forms,and the second-order perturbation sensitivity matrices of eigenvalues and eigenvectors are developed.With these formulations,the efficient methods based on the second-order Taylor expansion and second-order perturbation are obtained to estimate changes of eigenvalues and eigenvectors when the design parameters are changed. The presented method avoids direct differential operation,and thus reduces difficulty for computing the second-order sensitivity matrices of eigenpairs.A numerical example is given to demonstrate application and accuracy of the proposed method.展开更多
Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems.Developing efficient parameterized algorithms has become a very active research area in the current research in th...Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems.Developing efficient parameterized algorithms has become a very active research area in the current research in theoretical computer science. In this paper, we investigate a number of new algorithmic techniques that were proposed and initiated by ourselves in our research in parameterized computation. The techniques have proved to be very useful and promising,and have led to improved parameterized algorithms for many well-known NP-hard problems.展开更多
The complex wake flow of a GTS(ground transportation system)model contributes to large percentage of the aerodynamic drag force.Therefore,predicting accurate wake flow will help carry out the drag reduction strategies...The complex wake flow of a GTS(ground transportation system)model contributes to large percentage of the aerodynamic drag force.Therefore,predicting accurate wake flow will help carry out the drag reduction strategies.In this paper,the near-wake flow topology of the GTS was studied at Re=2.7×104 to assess the capability of a hybrid RANS/LES(Reynolds-averaged Navier–Stokes/large eddy simulation)approach,known as IDDES(improved delayed detached eddy simulation).The current study also aims to understand the effects of different computational parameters,e.g.the spatial resolution,time step,residual level,discretization scheme and turbulence model,on this asymmetrical wake flow configuration.A comparison of IDDES with previous water channel tests,wellresolved LES,partially averaged Navier–Stokes and URANS(unsteady RANS)was included to better understand the benefits of this hybrid RANS/LES approach.The results show that on the medium and fine grids,the IDDES produces an asymmetrical flow topology(known as flow state I)in the near-wake of the vertical midplane,as reported in previous studies.The recommended parameters for the time step(1×10^(–4 )s)and residual level(1×10^(–4))provide sufficient accuracy of wake predictions to show good agreement with experiments.For the convective term of the momentum equation in IDDES,the bounded central difference discretization scheme is proposed to be adopted for discretization.Additionally,URANS cannot accurately capture this asymmetrical flow field.IDDES proves to be capable of predicting thewake flowfield of this simplified heavy vehicle with high accuracy.All obtained conclusions can provide references for the aerodynamic drag reduction of the GTS.展开更多
基金supported by the National Natural Science Foundation of China (Nos. 61173051, 61103033, and 61232001)
文摘Parameterized computation is a new method dealing with NP-hard problems, which has attracted a lot of attentions in theoretical computer science. As a practical preprocessing method for NP-hard problems, kernelizaiton in parameterized computation has recently become an active research area. In this paper, we discuss several kernelizaiton techniques, such as crown decomposition, planar graph vertex partition, randomized methods, and kernel lower bounds, which have been used widely in the kernelization of many hard problems.
基金Project supported by the 985-Engineering Innovation of Graduate Students of Jilin Universitythe Science and Technology Development Foundation of Jilin Province(20070541)
文摘This paper presents methods for computing a second-order sensitivity matrix and the Hessian matrix of eigenvalues and eigenvectors of multiple parameter structures. Second-order perturbations of eigenvalues and eigenvectors are transformed into multiple parameter forms,and the second-order perturbation sensitivity matrices of eigenvalues and eigenvectors are developed.With these formulations,the efficient methods based on the second-order Taylor expansion and second-order perturbation are obtained to estimate changes of eigenvalues and eigenvectors when the design parameters are changed. The presented method avoids direct differential operation,and thus reduces difficulty for computing the second-order sensitivity matrices of eigenpairs.A numerical example is given to demonstrate application and accuracy of the proposed method.
基金partially supported by the National Natural Science Foundation of China under Grant Nos.61173051,61103033,and 71221061
文摘Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems.Developing efficient parameterized algorithms has become a very active research area in the current research in theoretical computer science. In this paper, we investigate a number of new algorithmic techniques that were proposed and initiated by ourselves in our research in parameterized computation. The techniques have proved to be very useful and promising,and have led to improved parameterized algorithms for many well-known NP-hard problems.
基金the Initial Funding of Specially ap-pointed Professorship of Central South University,China(Grant No.202045014)Natural Science Foundation of Hunan Province,China(Grant No.2020JJ4737).
文摘The complex wake flow of a GTS(ground transportation system)model contributes to large percentage of the aerodynamic drag force.Therefore,predicting accurate wake flow will help carry out the drag reduction strategies.In this paper,the near-wake flow topology of the GTS was studied at Re=2.7×104 to assess the capability of a hybrid RANS/LES(Reynolds-averaged Navier–Stokes/large eddy simulation)approach,known as IDDES(improved delayed detached eddy simulation).The current study also aims to understand the effects of different computational parameters,e.g.the spatial resolution,time step,residual level,discretization scheme and turbulence model,on this asymmetrical wake flow configuration.A comparison of IDDES with previous water channel tests,wellresolved LES,partially averaged Navier–Stokes and URANS(unsteady RANS)was included to better understand the benefits of this hybrid RANS/LES approach.The results show that on the medium and fine grids,the IDDES produces an asymmetrical flow topology(known as flow state I)in the near-wake of the vertical midplane,as reported in previous studies.The recommended parameters for the time step(1×10^(–4 )s)and residual level(1×10^(–4))provide sufficient accuracy of wake predictions to show good agreement with experiments.For the convective term of the momentum equation in IDDES,the bounded central difference discretization scheme is proposed to be adopted for discretization.Additionally,URANS cannot accurately capture this asymmetrical flow field.IDDES proves to be capable of predicting thewake flowfield of this simplified heavy vehicle with high accuracy.All obtained conclusions can provide references for the aerodynamic drag reduction of the GTS.
