In this paper,we construct a power type functional which is the approximation functional of the Singular Trudinger-Moser functional.Moreover,we obtain the concentration level of the functional and show it converges to...In this paper,we construct a power type functional which is the approximation functional of the Singular Trudinger-Moser functional.Moreover,we obtain the concentration level of the functional and show it converges to the concentration level of singular Trudinger-Moser functional on the unit ball.展开更多
This paper studies the Smoluchowski–Kramers approximation for a discrete-time dynamical system modeled as the motion of a particle in a force field.We show that the approximation holds for the drift-implicit Euler–M...This paper studies the Smoluchowski–Kramers approximation for a discrete-time dynamical system modeled as the motion of a particle in a force field.We show that the approximation holds for the drift-implicit Euler–Maruyama discretization and derive its convergence rate.In particular,the solution of the discretized system converges to the solution of the first-order limit equation in the mean-square sense,and this convergence is independent of the order in which the mass parameterμand the step size h tend to zero.展开更多
The Stackelberg prediction game(SPG)is a bilevel optimization frame-work for modeling strategic interactions between a learner and a follower.Existing meth-ods for solving this problem with general loss functions are ...The Stackelberg prediction game(SPG)is a bilevel optimization frame-work for modeling strategic interactions between a learner and a follower.Existing meth-ods for solving this problem with general loss functions are computationally expensive and scarce.We propose a novel hyper-gradient type method with a warm-start strategy to address this challenge.Particularly,we first use a Taylor expansion-based approach to obtain a good initial point.Then we apply a hyper-gradient descent method with an ex-plicit approximate hyper-gradient.We establish the convergence results of our algorithm theoretically.Furthermore,when the follower employs the least squares loss function,our method is shown to reach an e-stationary point by solving quadratic subproblems.Numerical experiments show our algorithms are empirically orders of magnitude faster than the state-of-the-art.展开更多
The three common genetic models(or modes of inheritance)in association analysis are the dominant,additive,and recessive models.It is known that the Cochran-Armitage trend test(CATT)which correctly incorporates informa...The three common genetic models(or modes of inheritance)in association analysis are the dominant,additive,and recessive models.It is known that the Cochran-Armitage trend test(CATT)which correctly incorporates information from genetic models,is more powerful than the commonly used Pearson’s chi-square test.However,the true genetic model is usually unknown in practice,and the power of the CAT test could be substantially reduced with a wrongly specified genetic model.To achieve a power that is close to that of a correctly specified CAT test,it is natural to apply trend tests under different possible genetic models and to report the most significant test result.This results in a MAX-type testing procedure,and it was found that this test is usually more powerful than the Pearson’s chi-square test.Although the signi-ficance(i.e.,p value)of the MAX-type test can be accessed by either large sample approximation or permutation methods,requirements for sample size or simulation replicates are demanding with respect to accuracy and efficiency.This paper proposes an approach to calculate the exact p values of MAX-type tests based on the combinatorial counting method.The simulation results show that the exact method is more accurate than the large sample approximation methods and more computationally efficient than the permutation method,and our method can be readily applied to genome-wide association studies(GWASs).The proposed methodis built in an R package,MaXact,which is available at the https://github.com/Myuan 2019/MaXact/.展开更多
The support vector machine （SVM） is a novel machine learning method, which has the ability to approximate nonlinear functions with arbitrary accuracy. Setting parameters well is very crucial for SVM learning results...The support vector machine （SVM） is a novel machine learning method, which has the ability to approximate nonlinear functions with arbitrary accuracy. Setting parameters well is very crucial for SVM learning results and generalization ability, and now there is no systematic, general method for parameter selection. In this article, the SVM parameter selection for function approximation is regarded as a compound optimization problem and a mutative scale chaos optimization algorithm is employed to search for optimal paraxneter values. The chaos optimization algorithm is an effective way for global optimal and the mutative scale chaos algorithm could improve the search efficiency and accuracy. Several simulation examples show the sensitivity of the SVM parameters and demonstrate the superiority of this proposed method for nonlinear function approximation.展开更多
A rational approximation method of the fractional-order derivative and integral operators is proposed. The turning fre- quency points are fixed in each frequency interval in the standard Oustaloup approximation. In th...A rational approximation method of the fractional-order derivative and integral operators is proposed. The turning fre- quency points are fixed in each frequency interval in the standard Oustaloup approximation. In the improved Oustaloup method, the turning frequency points are determined by the adaptive chaotic particle swarm optimization （PSO）. The average velocity is proposed to reduce the iterations of the PSO. The chaotic search scheme is combined to reduce the opportunity of the premature phenomenon. Two fitness functions are given to minimize the zero-pole and amplitude-phase frequency errors for the underlying optimization problems. Some numerical examples are compared to demonstrate the effectiveness and accuracy of this proposed rational approximation method.展开更多
This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain e...This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain environment. For adaptive selection of appropriate ESMs, we generalize an approximate dynamic programming(ADP) framework to the dynamic case. We define the environment model and agent model, respectively. To handle the partially observable challenge, we apply the unsented Kalman filter(UKF) algorithm for belief state estimation. To reduce the computational burden, a simulation-based approach rollout with a redesigned base policy is proposed to approximate the long-term cumulative reward. Meanwhile, Monte Carlo sampling is combined into the rollout to estimate the expectation of the rewards. The experiments indicate that our method outperforms other strategies due to its better performance in larger-scale problems.展开更多
A numerical triangulation and transformation into the time domain of a Kirchhoff approximation(KA)method is proposed for the modeling of bistatic scattering from an underwater non-penetrable target.The time domain sol...A numerical triangulation and transformation into the time domain of a Kirchhoff approximation(KA)method is proposed for the modeling of bistatic scattering from an underwater non-penetrable target.The time domain solution in this approximation can be split up into two parts:the solution of reflected field,contributing around the specular direction,and the solution of shadow radiation,contributing around the forward direction.An average solution in the time domain satisfying the reciprocity principle is presented.The solution is expressed in terms of non-singular functions.The proposed method is validated against a normal mode method for bistatic scattering from a rigid sphere.Moreover,the reflected and shadow highlights on the surface of the sphere are shown to verify the integration surface of the reflected field and shadow radiation.It is also tested against a finite element method and an experiment involving a scaled Benchmark Target Strength Simulation Submarine model.The time-angle bistatic spectra for the model are evaluated by the direct and transformed average solutions of KA,and the former accelerates its speed of calculation.The results are good,and show that this method can be used to predict the bistatic scattered field of a non-penetrable target.展开更多
A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-co...A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-continuous casting process. Unlike the full optimization of LR problems in traditional LR approaches, the machine capacity relaxation is optimized asymptotically, while the precedence relaxation is optimized approximately due to the NP-hard nature of its LR problem. Because the standard subgradient algorithm(SSA) cannot solve the Lagrangian dual(LD) problem within the partial optimization of LR problem, an effective deflected-conditional approximate subgradient level algorithm(DCASLA) was developed, named as Lagrangian relaxation level approach. The efficiency of the DCASLA is enhanced by a deflected-conditional epsilon-subgradient to weaken the possible zigzagging phenomena. Computational results and comparisons show that the proposed methods improve significantly the efficiency of the LR approach and the DCASLA adopting capacity relaxation strategy performs best among eight methods in terms of solution quality and running time.展开更多
A prescribed performance neural controller to guarantee tracking quality is addressed for the near space kinetic kill vehicle (NSKKV) to meet the state constraints caused by side window detection. Different from the t...A prescribed performance neural controller to guarantee tracking quality is addressed for the near space kinetic kill vehicle (NSKKV) to meet the state constraints caused by side window detection. Different from the traditional prescribed performance control in which the shape of the performance function is constant, this paper exploits new performance functions which can change the shape of their function according to different symbols of initial errors and can ensure the error convergence with a small overshoot. The neural backstepping control and the minimal learning parameters (MLP) technology are employed for exploring a prescribed performance controller (PPC) that provides robust tracking attitude reference trajectories. The highlight is that the transient performance of tracking errors is satisfactory and the computational load of neural approximation is low. The pseudo rate (PSR) modulator is used to shape the continuous control command to pulse or on-off signals to meet the requirements of the thruster. Numerical simulations show that the proposed method can achieve state constraints, pseudo-linear operation and high accuracy.展开更多
The aim of this paper is to discuss the approximate rea- soning problems with interval-valued fuzzy environments based on the fully implicational idea. First, this paper constructs a class of interval-valued fuzzy imp...The aim of this paper is to discuss the approximate rea- soning problems with interval-valued fuzzy environments based on the fully implicational idea. First, this paper constructs a class of interval-valued fuzzy implications by means of a type of impli- cations and a parameter on the unit interval, then uses them to establish fully implicational reasoning methods for interval-valued fuzzy modus ponens （IFMP） and interval-valued fuzzy modus tel- lens （IFMT） problems. At the same time the reversibility properties of these methods are analyzed and the reversible conditions are given. It is shown that the existing unified forms of α-triple I （the abbreviation of triple implications） methods for FMP and FMT can be seen as the particular cases of our methods for IFMP and IFMT.展开更多
The modelling of risky asset by stochastic processes with continuous paths, based on Brow- nian motions, suffers from several defects. First, the path continuity assumption does not seem reason- able in view of the po...The modelling of risky asset by stochastic processes with continuous paths, based on Brow- nian motions, suffers from several defects. First, the path continuity assumption does not seem reason- able in view of the possibility of sudden price variations （jumps） resulting of market crashes. A solution is to use stochastic processes with jumps, that will account for sudden variations of the asset prices. On the other hand, such jump models are generally based on the Poisson random measure. Many popular economic and financial models described by stochastic differential equations with Poisson jumps. This paper deals with the approximate controllability of a class of second-order neutral stochastic differential equations with infinite delay and Poisson jumps. By using the cosine family of operators, stochastic analysis techniques, a new set of sufficient conditions are derived for the approximate controllability of the above control system. An example is provided to illustrate the obtained theory.展开更多
To study the problem of knowledge translation in fuzzy approximation spaces, the concept of rough communication of crisp set in fuzzy approximation spaces is proposed. In a rough communication of crisp set in fuzzy ap...To study the problem of knowledge translation in fuzzy approximation spaces, the concept of rough communication of crisp set in fuzzy approximation spaces is proposed. In a rough communication of crisp set in fuzzy approximation spaces, the problem of uncertainty exists, for each agent has a different language and cannot provide precise communication to each other. By means of some concepts, such as CF rough communication cut, which is a bridge between fuzzy concept and crisp concept, cut analysis of CF rough communication is made, and the relation theorem between CF rough communication and rough communication of crisp concept is obtained. Finally, in order to give an intuitive analysis of the relation between CF rough communication and rough communication of crisp concept, an example is given.展开更多
文摘In this paper,we construct a power type functional which is the approximation functional of the Singular Trudinger-Moser functional.Moreover,we obtain the concentration level of the functional and show it converges to the concentration level of singular Trudinger-Moser functional on the unit ball.
基金supported by the PhD Research Startup Foundation of Hubei University of Economics(Grand No.XJ23BS42).
文摘This paper studies the Smoluchowski–Kramers approximation for a discrete-time dynamical system modeled as the motion of a particle in a force field.We show that the approximation holds for the drift-implicit Euler–Maruyama discretization and derive its convergence rate.In particular,the solution of the discretized system converges to the solution of the first-order limit equation in the mean-square sense,and this convergence is independent of the order in which the mass parameterμand the step size h tend to zero.
文摘The Stackelberg prediction game(SPG)is a bilevel optimization frame-work for modeling strategic interactions between a learner and a follower.Existing meth-ods for solving this problem with general loss functions are computationally expensive and scarce.We propose a novel hyper-gradient type method with a warm-start strategy to address this challenge.Particularly,we first use a Taylor expansion-based approach to obtain a good initial point.Then we apply a hyper-gradient descent method with an ex-plicit approximate hyper-gradient.We establish the convergence results of our algorithm theoretically.Furthermore,when the follower employs the least squares loss function,our method is shown to reach an e-stationary point by solving quadratic subproblems.Numerical experiments show our algorithms are empirically orders of magnitude faster than the state-of-the-art.
基金This work was supported by the Natural Science Foundation of Anhui Province(2008085MA09)the National Natural Science Foundation of China(11671375).
文摘The three common genetic models(or modes of inheritance)in association analysis are the dominant,additive,and recessive models.It is known that the Cochran-Armitage trend test(CATT)which correctly incorporates information from genetic models,is more powerful than the commonly used Pearson’s chi-square test.However,the true genetic model is usually unknown in practice,and the power of the CAT test could be substantially reduced with a wrongly specified genetic model.To achieve a power that is close to that of a correctly specified CAT test,it is natural to apply trend tests under different possible genetic models and to report the most significant test result.This results in a MAX-type testing procedure,and it was found that this test is usually more powerful than the Pearson’s chi-square test.Although the signi-ficance(i.e.,p value)of the MAX-type test can be accessed by either large sample approximation or permutation methods,requirements for sample size or simulation replicates are demanding with respect to accuracy and efficiency.This paper proposes an approach to calculate the exact p values of MAX-type tests based on the combinatorial counting method.The simulation results show that the exact method is more accurate than the large sample approximation methods and more computationally efficient than the permutation method,and our method can be readily applied to genome-wide association studies(GWASs).The proposed methodis built in an R package,MaXact,which is available at the https://github.com/Myuan 2019/MaXact/.
基金the National Nature Science Foundation of China (60775047, 60402024)
文摘The support vector machine （SVM） is a novel machine learning method, which has the ability to approximate nonlinear functions with arbitrary accuracy. Setting parameters well is very crucial for SVM learning results and generalization ability, and now there is no systematic, general method for parameter selection. In this article, the SVM parameter selection for function approximation is regarded as a compound optimization problem and a mutative scale chaos optimization algorithm is employed to search for optimal paraxneter values. The chaos optimization algorithm is an effective way for global optimal and the mutative scale chaos algorithm could improve the search efficiency and accuracy. Several simulation examples show the sensitivity of the SVM parameters and demonstrate the superiority of this proposed method for nonlinear function approximation.
基金supported by the National Natural Science Foundation of China (10872030)
文摘A rational approximation method of the fractional-order derivative and integral operators is proposed. The turning fre- quency points are fixed in each frequency interval in the standard Oustaloup approximation. In the improved Oustaloup method, the turning frequency points are determined by the adaptive chaotic particle swarm optimization （PSO）. The average velocity is proposed to reduce the iterations of the PSO. The chaotic search scheme is combined to reduce the opportunity of the premature phenomenon. Two fitness functions are given to minimize the zero-pole and amplitude-phase frequency errors for the underlying optimization problems. Some numerical examples are compared to demonstrate the effectiveness and accuracy of this proposed rational approximation method.
基金supported by the National Natural Science Foundation of China(6157328561305133)
文摘This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain environment. For adaptive selection of appropriate ESMs, we generalize an approximate dynamic programming(ADP) framework to the dynamic case. We define the environment model and agent model, respectively. To handle the partially observable challenge, we apply the unsented Kalman filter(UKF) algorithm for belief state estimation. To reduce the computational burden, a simulation-based approach rollout with a redesigned base policy is proposed to approximate the long-term cumulative reward. Meanwhile, Monte Carlo sampling is combined into the rollout to estimate the expectation of the rewards. The experiments indicate that our method outperforms other strategies due to its better performance in larger-scale problems.
基金the Oceanic Interdisciplinary Program of Shanghai Jiao Tong University(project number SL2021PT108)。
文摘A numerical triangulation and transformation into the time domain of a Kirchhoff approximation(KA)method is proposed for the modeling of bistatic scattering from an underwater non-penetrable target.The time domain solution in this approximation can be split up into two parts:the solution of reflected field,contributing around the specular direction,and the solution of shadow radiation,contributing around the forward direction.An average solution in the time domain satisfying the reciprocity principle is presented.The solution is expressed in terms of non-singular functions.The proposed method is validated against a normal mode method for bistatic scattering from a rigid sphere.Moreover,the reflected and shadow highlights on the surface of the sphere are shown to verify the integration surface of the reflected field and shadow radiation.It is also tested against a finite element method and an experiment involving a scaled Benchmark Target Strength Simulation Submarine model.The time-angle bistatic spectra for the model are evaluated by the direct and transformed average solutions of KA,and the former accelerates its speed of calculation.The results are good,and show that this method can be used to predict the bistatic scattered field of a non-penetrable target.
基金Projects(51435009,51575212,61573249,61371200)supported by the National Natural Science Foundation of ChinaProjects(2015T80798,2014M552040,2014M561250,2015M571328)supported by Postdoctoral Science Foundation of ChinaProject(L2015372)supported by Liaoning Province Education Administration,China
文摘A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-continuous casting process. Unlike the full optimization of LR problems in traditional LR approaches, the machine capacity relaxation is optimized asymptotically, while the precedence relaxation is optimized approximately due to the NP-hard nature of its LR problem. Because the standard subgradient algorithm(SSA) cannot solve the Lagrangian dual(LD) problem within the partial optimization of LR problem, an effective deflected-conditional approximate subgradient level algorithm(DCASLA) was developed, named as Lagrangian relaxation level approach. The efficiency of the DCASLA is enhanced by a deflected-conditional epsilon-subgradient to weaken the possible zigzagging phenomena. Computational results and comparisons show that the proposed methods improve significantly the efficiency of the LR approach and the DCASLA adopting capacity relaxation strategy performs best among eight methods in terms of solution quality and running time.
基金supported by the National Natural Science Foundation of China(61773398 61703421)
文摘A prescribed performance neural controller to guarantee tracking quality is addressed for the near space kinetic kill vehicle (NSKKV) to meet the state constraints caused by side window detection. Different from the traditional prescribed performance control in which the shape of the performance function is constant, this paper exploits new performance functions which can change the shape of their function according to different symbols of initial errors and can ensure the error convergence with a small overshoot. The neural backstepping control and the minimal learning parameters (MLP) technology are employed for exploring a prescribed performance controller (PPC) that provides robust tracking attitude reference trajectories. The highlight is that the transient performance of tracking errors is satisfactory and the computational load of neural approximation is low. The pseudo rate (PSR) modulator is used to shape the continuous control command to pulse or on-off signals to meet the requirements of the thruster. Numerical simulations show that the proposed method can achieve state constraints, pseudo-linear operation and high accuracy.
基金supported by the National Natural Science Foundation of China(60774100)the Natural Science Foundation of Shandong Province of China(Y2007A15)
文摘The aim of this paper is to discuss the approximate rea- soning problems with interval-valued fuzzy environments based on the fully implicational idea. First, this paper constructs a class of interval-valued fuzzy implications by means of a type of impli- cations and a parameter on the unit interval, then uses them to establish fully implicational reasoning methods for interval-valued fuzzy modus ponens （IFMP） and interval-valued fuzzy modus tel- lens （IFMT） problems. At the same time the reversibility properties of these methods are analyzed and the reversible conditions are given. It is shown that the existing unified forms of α-triple I （the abbreviation of triple implications） methods for FMP and FMT can be seen as the particular cases of our methods for IFMP and IFMT.
基金supported by the National Board for Higher Mathematics,Mumbai,India under Grant No.2/48(5)/2013/NBHM(R.P.)/RD-II/688 dt 16.01.2014
文摘The modelling of risky asset by stochastic processes with continuous paths, based on Brow- nian motions, suffers from several defects. First, the path continuity assumption does not seem reason- able in view of the possibility of sudden price variations （jumps） resulting of market crashes. A solution is to use stochastic processes with jumps, that will account for sudden variations of the asset prices. On the other hand, such jump models are generally based on the Poisson random measure. Many popular economic and financial models described by stochastic differential equations with Poisson jumps. This paper deals with the approximate controllability of a class of second-order neutral stochastic differential equations with infinite delay and Poisson jumps. By using the cosine family of operators, stochastic analysis techniques, a new set of sufficient conditions are derived for the approximate controllability of the above control system. An example is provided to illustrate the obtained theory.
基金supported by the Natural Science Foundation of Shandong Province (Y2006A12)the Scientific Research Development Project of Shandong Provincial Education Department (J06P01)+2 种基金the Science and Technology Foundation of Universityof Jinan (XKY0808 XKY0703)the Doctoral Foundation of University of Jinan (B0633).
文摘To study the problem of knowledge translation in fuzzy approximation spaces, the concept of rough communication of crisp set in fuzzy approximation spaces is proposed. In a rough communication of crisp set in fuzzy approximation spaces, the problem of uncertainty exists, for each agent has a different language and cannot provide precise communication to each other. By means of some concepts, such as CF rough communication cut, which is a bridge between fuzzy concept and crisp concept, cut analysis of CF rough communication is made, and the relation theorem between CF rough communication and rough communication of crisp concept is obtained. Finally, in order to give an intuitive analysis of the relation between CF rough communication and rough communication of crisp concept, an example is given.
