This article studies the existence and uniqueness of the mild solution of a family of control systems with a delay that are governed by the nonlinear fractional evolution differential equations in Banach spaces.Moreov...This article studies the existence and uniqueness of the mild solution of a family of control systems with a delay that are governed by the nonlinear fractional evolution differential equations in Banach spaces.Moreover,we establish the controllability of the considered system.To do so,first,we investigate the approximate controllability of the corresponding linear system.Subsequently,we prove the nonlinear system is approximately controllable if the corresponding linear system is approximately controllable.To reach the conclusions,the theory of resolvent operators,the Banach contraction mapping principle,and fixed point theorems are used.While concluding,some examples are given to demonstrate the efficacy of the proposed results.展开更多
In this article,we study the approximate controllability of neutral partial differential equations with Hilfer fractional derivative and not instantaneous impulses effects.By using the Sadovskii's fixed point theo...In this article,we study the approximate controllability of neutral partial differential equations with Hilfer fractional derivative and not instantaneous impulses effects.By using the Sadovskii's fixed point theorem,fractional calculus and resolvent operator functions,we prove the approximate controllability of the considered system.展开更多
As data analysis often incurs significant communication and computational costs,these tasks are increasingly outsourced to cloud computing platforms.However,this introduces privacy concerns,as sensitive data must be t...As data analysis often incurs significant communication and computational costs,these tasks are increasingly outsourced to cloud computing platforms.However,this introduces privacy concerns,as sensitive data must be transmitted to and processed by untrusted parties.To address this,fully homomorphic encryption(FHE)has emerged as a promising solution for privacy-preserving Machine-Learning-as-a-Service(MLaaS),enabling computation on encrypted data without revealing the plaintext.Nevertheless,FHE remains computationally expensive.As a result,approximate homomorphic encryption(AHE)schemes,such as CKKS,have attracted attention due to their efficiency.In our previous work,we proposed RP-OKC,a CKKS-based clustering scheme implemented via TenSEAL.However,errors inherent to CKKS operations—termed CKKS-errors—can affect the accuracy of the result after decryption.Since these errors can be mitigated through post-decryption rounding,we propose a data pre-scaling technique to increase the number of significant digits and reduce CKKS-errors.Furthermore,we introduce an Operation-Error-Estimation(OEE)table that quantifies upper-bound error estimates for various CKKS operations.This table enables error-aware decryption correction,ensuring alignment between encrypted and plaintext results.We validate our method on K-means clustering using the Kaggle Customer Segmentation dataset.Experimental results confirm that the proposed scheme enhances the accuracy and reliability of privacy-preserving data analysis in cloud environments.展开更多
As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and soluti...As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and solution optimality.To tackle this issue,we propose a problem-structure-informed quantum approximate optimization algorithm(QAOA)framework that fully exploits the quantum advantage under extremely limited quantum resources.Specifically,we leverage the inherent topological structure of power systems to decompose large-scale UCP instances into smaller subproblems,which are solvable in parallel by limited number of qubits.This decomposition not only circumvents the current hardware limitations of quantum computing but also achieves higher performance as the graph structure of the power system becomes more sparse.Consequently,our approach can be extended to future power systems that are larger and more complex.展开更多
Stratified flow is a common phenomenon in horizontal tubes of two-phase flow systems. However, the existing methods for calculating the wetted angle of the flat interface model and the central angle of the two-circle ...Stratified flow is a common phenomenon in horizontal tubes of two-phase flow systems. However, the existing methods for calculating the wetted angle of the flat interface model and the central angle of the two-circle model rely on solving implicit transcendental equations, which require iterative numerical root-finding methods,thereby introducing computational complexity and inefficiency. This paper proposes the high-precision explicit approximate solutions for the two models, directly correlating the geometric parameters with the flow parameters, thus significantly enhancing the efficiency and accuracy of two-phase flow analysis.展开更多
To reduce vehicle emissions in road networks, a new signal coordination algorithm based on approximate dynamic programming （ADP） is developed for two intersections. Taking the Jetta car as an experimental vehicle, f...To reduce vehicle emissions in road networks, a new signal coordination algorithm based on approximate dynamic programming （ADP） is developed for two intersections. Taking the Jetta car as an experimental vehicle, field tests are conducted in Changchun Street of Changchun city and vehicle emission factors in complete stop and uniform speed states are collected. Queue lengths and signal light colors of approach lanes are selected as state variables, and green switch plans are selected as decision variables of the system. Then the calculation model of the optimization index during the planning horizon is developed based on the basis function method of the ADP. The temporal-difference algorithm is employed to update the weighting factor vector of the approximate function. Simulations are conducted in Matlab and the results show that the established algorithm outperforms the conventional coordination algorithm in reducing vehicle emissions by 8.2%. Sensitive analysis of the planning horizon length on the evaluation index is also conducted and the statistical results show that the optimal length of the planning horizon is directly proportional to the traffic load.展开更多
Reverse k nearest neighbor （RNNk） is a generalization of the reverse nearest neighbor problem and receives increasing attention recently in the spatial data index and query. RNNk query is to retrieve all the data po...Reverse k nearest neighbor （RNNk） is a generalization of the reverse nearest neighbor problem and receives increasing attention recently in the spatial data index and query. RNNk query is to retrieve all the data points which use a query point as one of their k nearest neighbors. To answer the RNNk of queries efficiently, the properties of the Voronoi cell and the space-dividing regions are applied. The RNNk of the given point can be found without computing its nearest neighbors every time by using the rank Voronoi cell. With the elementary RNNk query result, the candidate data points of reverse nearest neighbors can he further limited by the approximation with sweepline and the partial extension of query region Q. The approximate minimum average distance （AMAD） can be calculated by the approximate RNNk without the restriction of k. Experimental results indicate the efficiency and the effectiveness of the algorithm and the approximate method in three varied data distribution spaces. The approximate query and the calculation method with the high precision and the accurate recall are obtained by filtrating data and pruning the search space.展开更多
This paper proposes two kinds of approximate proximal point algorithms （APPA） for monotone variational inequalities, both of which can be viewed as two extended versions of Solodov and Svaiter＇s APPA in the paper ...This paper proposes two kinds of approximate proximal point algorithms （APPA） for monotone variational inequalities, both of which can be viewed as two extended versions of Solodov and Svaiter＇s APPA in the paper ＂Error bounds for proximal point subproblems and associated inexact proximal point algorithms＂ published in 2000. They are both prediction- correction methods which use the same inexactness restriction; the only difference is that they use different search directions in the correction steps. This paper also chooses an optimal step size in the two versions of the APPA to improve the profit at each iteration. Analysis also shows that the two APPAs are globally convergent under appropriate assumptions, and we can expect algorithm 2 to get more progress in every iteration than algorithm 1. Numerical experiments indicate that algorithm 2 is more efficient than algorithm 1 with the same correction step size,展开更多
In this article, we introduce and characterize approximate duality for g-frames. We get some important properties and applications of approximate duals. We also obtain some new results in approximate duality of frames...In this article, we introduce and characterize approximate duality for g-frames. We get some important properties and applications of approximate duals. We also obtain some new results in approximate duality of frames, and generalize some of the known results in approximate duality of frames to g-frames. We also get some results for fusion frames, and perturbation of approximately dual g-frames. We show that approximate duals are stable under small perturbations and they are useful for erasures and reconstruction.展开更多
Electroencephalogram signals are time-varying complex electrophysiological signals. Existing studies show that approximate entropy, which is a nonlinear dynamics index, is not an ideal method for electroencephalogram ...Electroencephalogram signals are time-varying complex electrophysiological signals. Existing studies show that approximate entropy, which is a nonlinear dynamics index, is not an ideal method for electroencephalogram analysis. Clinical electroencephalogram measurements usually contain electrical interference signals, creating additional challenges in terms of maintaining robustness of the analytic methods. There is an urgent need for a novel method of nonlinear dynamical analysis of the electroencephalogram that can characterize seizure-related changes in cerebral dynamics. The aim of this paper was to study the fluctuations of approximate entropy in preictal, ictal, and postictal electroencephalogram signals from a patient with absence seizures, and to improve the algorithm used to calculate the approximate entropy. The approximate entropy algorithm, especially our modified version, could accurately describe the dynamical changes of the brain during absence seizures. We could also demonstrate that the complexity of the brain was greater in the normal state than in the ictal state. The fluctuations of the approximate entropy before epileptic seizures observed in this study can form a good basis for further study on the prediction of seizures with nonlinear dynamics.展开更多
Boundary inner and outer operators are introduced, and union, intersection, complement operators of approximations are redefined. The approximation operators have a good property of maintaining union, intersection, co...Boundary inner and outer operators are introduced, and union, intersection, complement operators of approximations are redefined. The approximation operators have a good property of maintaining union, intersection, complement operators, so the rough set theory has been enriched from the operator-oriented and set-oriented views. Approximate power set spaces are defined, and it is proved that the approximation operators are epimorphisms from power set space to approximate power set spaces. Some basic properties of approximate power set space are got by epimorphisms in contrast to power set space.展开更多
This research proposes a novel three-dimensional gravity inversion based on sparse recovery in compress sensing. Zero norm is selected as the objective function, which is then iteratively solved by the approximate zer...This research proposes a novel three-dimensional gravity inversion based on sparse recovery in compress sensing. Zero norm is selected as the objective function, which is then iteratively solved by the approximate zero norm solution. The inversion approach mainly employs forward modeling; a depth weight function is introduced into the objective function of the zero norms. Sparse inversion results are obtained by the corresponding optimal mathematical method. To achieve the practical geophysical and geological significance of the results, penalty function is applied to constrain the density values. Results obtained by proposed provide clear boundary depth and density contrast distribution information. The method's accuracy, validity, and reliability are verified by comparing its results with those of synthetic models. To further explain its reliability, a practical gravity data is obtained for a region in Texas, USA is applied. Inversion results for this region are compared with those of previous studies, including a research of logging data in the same area. The depth of salt dome obtained by the inversion method is 4.2 km, which is in good agreement with the 4.4 km value from the logging data. From this, the practicality of the inversion method is also validated.展开更多
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 novel method for obtaining the approximate symmetry of a partial differential equation with a small parameter is introduced. By expanding the independent variable and the dependent variable in the small parameter se...A novel method for obtaining the approximate symmetry of a partial differential equation with a small parameter is introduced. By expanding the independent variable and the dependent variable in the small parameter series, we obtain more affluent approximate symmetries. The method is applied to two perturbed nonlinear partial differential equations and new approximate solutions are derived.展开更多
The Alekseevskii–Tate model is the most successful semi-hydrodynamic model applied to long-rod penetration into semi-infinite targets. However, due to the nonlinear nature of the equations, the rod(tail) velocity, pe...The Alekseevskii–Tate model is the most successful semi-hydrodynamic model applied to long-rod penetration into semi-infinite targets. However, due to the nonlinear nature of the equations, the rod(tail) velocity, penetration velocity, rod length, and penetration depth were obtained implicitly as a function of time and solved numerically By employing a linear approximation to the logarithmic relative rod length, we obtain two sets of explicit approximate algebraic solutions based on the implicit theoretica solution deduced from primitive equations. It is very convenient in the theoretical prediction of the Alekseevskii–Tate model to apply these simple algebraic solutions. In particular, approximate solution 1 shows good agreement with the theoretical(exact) solution, and the first-order perturbation solution obtained by Walters et al.(Int. J. Impac Eng. 33:837–846, 2006) can be deemed as a special form of approximate solution 1 in high-speed penetration. Meanwhile, with constant tail velocity and penetration velocity approximate solution 2 has very simple expressions, which is applicable for the qualitative analysis of long-rod penetration. Differences among these two approximate solutions and the theoretical(exact) solution and their respective scopes of application have been discussed, and the inferences with clear physical basis have been drawn. In addition, these two solutions and the first-order perturbation solution are applied to two cases with different initial impact velocity and different penetrator/target combinations to compare with the theoretical(exact) solution. Approximate solution 1 is much closer to the theoretical solution of the Alekseevskii–Tate model than the first-order perturbation solution in both cases, whilst approximate solution 2 brings us a more intuitive understanding of quasi-steady-state penetration.展开更多
Based on the generalized diffraction integral formula and the idea that the angle misalignment of the cat-eye optical lens can be transformed into the displacement misalignment,an approximate analytical propagation fo...Based on the generalized diffraction integral formula and the idea that the angle misalignment of the cat-eye optical lens can be transformed into the displacement misalignment,an approximate analytical propagation formula for Gaussian beams through a cat-eye optical lens under large incidence angle condition is derived.Numerical results show that the diffraction effect of the apertures of the cat-eye optical lens becomes stronger along with the increase in incidence angle.The results are also compared with those from using an angular spectrum diffraction integral and experiment to illustrate the applicability and validity of our theoretical formula.It is shown that the approximate extent is good enough for the application of a cat-eye optical lens with a radius of 20 mm and a propagation distance of 100 m,and the approximate extent becomes better along with the increase in the radius of the cat-eye optical lens and the propagation distance.展开更多
In this paper, by means of combining non-probabilistic convex modeling with perturbation theory, an improvement is made on the first order approximate solution in convex models of uncertainties. Convex modeling is ext...In this paper, by means of combining non-probabilistic convex modeling with perturbation theory, an improvement is made on the first order approximate solution in convex models of uncertainties. Convex modeling is extended to largely uncertain and non-convex sets of uncertainties and the combinational convex modeling is developed. The presented method not only extends applications of convex modeling, but also improves its accuracy in uncertain problems and computational efficiency. The numerical example illustrates the efficiency of the proposed method.展开更多
This paper has two sections which deals with a second order stochastic neutral partial differential equation with state dependent delay. In the first section the existence and uniqueness of mild solution is obtained b...This paper has two sections which deals with a second order stochastic neutral partial differential equation with state dependent delay. In the first section the existence and uniqueness of mild solution is obtained by use of measure of non-compactness. In the second section the conditions for approximate controllability are investigated for the distributed second order neutral stochastic differential system with respect to the approximate controllability of the corresponding linear system in a Hilbert space. Our method is an extension of co-author N. Sukavanam’s novel approach in [22]. Thereby, we remove the need to assume the invertibility of a controllability operator used by authors in [5], which fails to exist in infinite dimensional spaces if the associated semigroup is compact. Our approach also removes the need to check the invertibility of the controllability Gramian operator and associated limit condition used by the authors in [20], which are practically difficult to verify and apply. An example is provided to illustrate the presented theory.展开更多
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.展开更多
文摘This article studies the existence and uniqueness of the mild solution of a family of control systems with a delay that are governed by the nonlinear fractional evolution differential equations in Banach spaces.Moreover,we establish the controllability of the considered system.To do so,first,we investigate the approximate controllability of the corresponding linear system.Subsequently,we prove the nonlinear system is approximately controllable if the corresponding linear system is approximately controllable.To reach the conclusions,the theory of resolvent operators,the Banach contraction mapping principle,and fixed point theorems are used.While concluding,some examples are given to demonstrate the efficacy of the proposed results.
基金Supported by Shandong University of Finance and Economics 2023 International Collaborative Projectsthe National Natural Science Foundation of China(Grant No.62073190)。
文摘In this article,we study the approximate controllability of neutral partial differential equations with Hilfer fractional derivative and not instantaneous impulses effects.By using the Sadovskii's fixed point theorem,fractional calculus and resolvent operator functions,we prove the approximate controllability of the considered system.
基金funded by National Science and Technology Council,Taiwan,grant numbers are 110-2401-H-002-094-MY2 and 112-2221-E-130-001.
文摘As data analysis often incurs significant communication and computational costs,these tasks are increasingly outsourced to cloud computing platforms.However,this introduces privacy concerns,as sensitive data must be transmitted to and processed by untrusted parties.To address this,fully homomorphic encryption(FHE)has emerged as a promising solution for privacy-preserving Machine-Learning-as-a-Service(MLaaS),enabling computation on encrypted data without revealing the plaintext.Nevertheless,FHE remains computationally expensive.As a result,approximate homomorphic encryption(AHE)schemes,such as CKKS,have attracted attention due to their efficiency.In our previous work,we proposed RP-OKC,a CKKS-based clustering scheme implemented via TenSEAL.However,errors inherent to CKKS operations—termed CKKS-errors—can affect the accuracy of the result after decryption.Since these errors can be mitigated through post-decryption rounding,we propose a data pre-scaling technique to increase the number of significant digits and reduce CKKS-errors.Furthermore,we introduce an Operation-Error-Estimation(OEE)table that quantifies upper-bound error estimates for various CKKS operations.This table enables error-aware decryption correction,ensuring alignment between encrypted and plaintext results.We validate our method on K-means clustering using the Kaggle Customer Segmentation dataset.Experimental results confirm that the proposed scheme enhances the accuracy and reliability of privacy-preserving data analysis in cloud environments.
文摘As power systems expand,solving the unit commitment problem(UCP)becomes increasingly challenging due to the curse of dimensionality,and traditional methods often struggle to balance computational efficiency and solution optimality.To tackle this issue,we propose a problem-structure-informed quantum approximate optimization algorithm(QAOA)framework that fully exploits the quantum advantage under extremely limited quantum resources.Specifically,we leverage the inherent topological structure of power systems to decompose large-scale UCP instances into smaller subproblems,which are solvable in parallel by limited number of qubits.This decomposition not only circumvents the current hardware limitations of quantum computing but also achieves higher performance as the graph structure of the power system becomes more sparse.Consequently,our approach can be extended to future power systems that are larger and more complex.
基金supported by the General Research Fund from the Research Grants Council of the Hong Kong Special Administrative Region of China (No. PolyU 15210624)。
文摘Stratified flow is a common phenomenon in horizontal tubes of two-phase flow systems. However, the existing methods for calculating the wetted angle of the flat interface model and the central angle of the two-circle model rely on solving implicit transcendental equations, which require iterative numerical root-finding methods,thereby introducing computational complexity and inefficiency. This paper proposes the high-precision explicit approximate solutions for the two models, directly correlating the geometric parameters with the flow parameters, thus significantly enhancing the efficiency and accuracy of two-phase flow analysis.
基金The National High Technology Research and Development Program of China (863 Program ) (No. 2011AA110304 )the National Natural Science Foundation of China (No. 50908100)
文摘To reduce vehicle emissions in road networks, a new signal coordination algorithm based on approximate dynamic programming （ADP） is developed for two intersections. Taking the Jetta car as an experimental vehicle, field tests are conducted in Changchun Street of Changchun city and vehicle emission factors in complete stop and uniform speed states are collected. Queue lengths and signal light colors of approach lanes are selected as state variables, and green switch plans are selected as decision variables of the system. Then the calculation model of the optimization index during the planning horizon is developed based on the basis function method of the ADP. The temporal-difference algorithm is employed to update the weighting factor vector of the approximate function. Simulations are conducted in Matlab and the results show that the established algorithm outperforms the conventional coordination algorithm in reducing vehicle emissions by 8.2%. Sensitive analysis of the planning horizon length on the evaluation index is also conducted and the statistical results show that the optimal length of the planning horizon is directly proportional to the traffic load.
基金Supported by the National Natural Science Foundation of China (60673136)the Natural Science Foundation of Heilongjiang Province of China (F200601)~~
文摘Reverse k nearest neighbor （RNNk） is a generalization of the reverse nearest neighbor problem and receives increasing attention recently in the spatial data index and query. RNNk query is to retrieve all the data points which use a query point as one of their k nearest neighbors. To answer the RNNk of queries efficiently, the properties of the Voronoi cell and the space-dividing regions are applied. The RNNk of the given point can be found without computing its nearest neighbors every time by using the rank Voronoi cell. With the elementary RNNk query result, the candidate data points of reverse nearest neighbors can he further limited by the approximation with sweepline and the partial extension of query region Q. The approximate minimum average distance （AMAD） can be calculated by the approximate RNNk without the restriction of k. Experimental results indicate the efficiency and the effectiveness of the algorithm and the approximate method in three varied data distribution spaces. The approximate query and the calculation method with the high precision and the accurate recall are obtained by filtrating data and pruning the search space.
文摘This paper proposes two kinds of approximate proximal point algorithms （APPA） for monotone variational inequalities, both of which can be viewed as two extended versions of Solodov and Svaiter＇s APPA in the paper ＂Error bounds for proximal point subproblems and associated inexact proximal point algorithms＂ published in 2000. They are both prediction- correction methods which use the same inexactness restriction; the only difference is that they use different search directions in the correction steps. This paper also chooses an optimal step size in the two versions of the APPA to improve the profit at each iteration. Analysis also shows that the two APPAs are globally convergent under appropriate assumptions, and we can expect algorithm 2 to get more progress in every iteration than algorithm 1. Numerical experiments indicate that algorithm 2 is more efficient than algorithm 1 with the same correction step size,
文摘In this article, we introduce and characterize approximate duality for g-frames. We get some important properties and applications of approximate duals. We also obtain some new results in approximate duality of frames, and generalize some of the known results in approximate duality of frames to g-frames. We also get some results for fusion frames, and perturbation of approximately dual g-frames. We show that approximate duals are stable under small perturbations and they are useful for erasures and reconstruction.
基金supported by the National Natural Science Foundation of China, No.10671213 and 11101440the Natural Science Foundation of Guangdong ProvinceFundamental Research Funds for the Central Universities
文摘Electroencephalogram signals are time-varying complex electrophysiological signals. Existing studies show that approximate entropy, which is a nonlinear dynamics index, is not an ideal method for electroencephalogram analysis. Clinical electroencephalogram measurements usually contain electrical interference signals, creating additional challenges in terms of maintaining robustness of the analytic methods. There is an urgent need for a novel method of nonlinear dynamical analysis of the electroencephalogram that can characterize seizure-related changes in cerebral dynamics. The aim of this paper was to study the fluctuations of approximate entropy in preictal, ictal, and postictal electroencephalogram signals from a patient with absence seizures, and to improve the algorithm used to calculate the approximate entropy. The approximate entropy algorithm, especially our modified version, could accurately describe the dynamical changes of the brain during absence seizures. We could also demonstrate that the complexity of the brain was greater in the normal state than in the ictal state. The fluctuations of the approximate entropy before epileptic seizures observed in this study can form a good basis for further study on the prediction of seizures with nonlinear dynamics.
基金Supported by the National Natural Science Foundation of China (No.69803007)
文摘Boundary inner and outer operators are introduced, and union, intersection, complement operators of approximations are redefined. The approximation operators have a good property of maintaining union, intersection, complement operators, so the rough set theory has been enriched from the operator-oriented and set-oriented views. Approximate power set spaces are defined, and it is proved that the approximation operators are epimorphisms from power set space to approximate power set spaces. Some basic properties of approximate power set space are got by epimorphisms in contrast to power set space.
基金supported by the Development of airborne gravity gradiometer(No.2017YFC0601601)open subject of Key Laboratory of Petroleum Resources Research,Institute of Geology and Geophysics,Chinese Academy of Sciences(No.KLOR2018-8)
文摘This research proposes a novel three-dimensional gravity inversion based on sparse recovery in compress sensing. Zero norm is selected as the objective function, which is then iteratively solved by the approximate zero norm solution. The inversion approach mainly employs forward modeling; a depth weight function is introduced into the objective function of the zero norms. Sparse inversion results are obtained by the corresponding optimal mathematical method. To achieve the practical geophysical and geological significance of the results, penalty function is applied to constrain the density values. Results obtained by proposed provide clear boundary depth and density contrast distribution information. The method's accuracy, validity, and reliability are verified by comparing its results with those of synthetic models. To further explain its reliability, a practical gravity data is obtained for a region in Texas, USA is applied. Inversion results for this region are compared with those of previous studies, including a research of logging data in the same area. The depth of salt dome obtained by the inversion method is 4.2 km, which is in good agreement with the 4.4 km value from the logging data. From this, the practicality of the inversion method is also validated.
基金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.
文摘A novel method for obtaining the approximate symmetry of a partial differential equation with a small parameter is introduced. By expanding the independent variable and the dependent variable in the small parameter series, we obtain more affluent approximate symmetries. The method is applied to two perturbed nonlinear partial differential equations and new approximate solutions are derived.
基金supported by the National Outstanding Young Scientist Foundation of China (Grant 11225213)the Key Subject "Computational Solid Mechanics" of China Academy of Engineering Physics
文摘The Alekseevskii–Tate model is the most successful semi-hydrodynamic model applied to long-rod penetration into semi-infinite targets. However, due to the nonlinear nature of the equations, the rod(tail) velocity, penetration velocity, rod length, and penetration depth were obtained implicitly as a function of time and solved numerically By employing a linear approximation to the logarithmic relative rod length, we obtain two sets of explicit approximate algebraic solutions based on the implicit theoretica solution deduced from primitive equations. It is very convenient in the theoretical prediction of the Alekseevskii–Tate model to apply these simple algebraic solutions. In particular, approximate solution 1 shows good agreement with the theoretical(exact) solution, and the first-order perturbation solution obtained by Walters et al.(Int. J. Impac Eng. 33:837–846, 2006) can be deemed as a special form of approximate solution 1 in high-speed penetration. Meanwhile, with constant tail velocity and penetration velocity approximate solution 2 has very simple expressions, which is applicable for the qualitative analysis of long-rod penetration. Differences among these two approximate solutions and the theoretical(exact) solution and their respective scopes of application have been discussed, and the inferences with clear physical basis have been drawn. In addition, these two solutions and the first-order perturbation solution are applied to two cases with different initial impact velocity and different penetrator/target combinations to compare with the theoretical(exact) solution. Approximate solution 1 is much closer to the theoretical solution of the Alekseevskii–Tate model than the first-order perturbation solution in both cases, whilst approximate solution 2 brings us a more intuitive understanding of quasi-steady-state penetration.
基金the Fund of the National Defense Pre-Research Foundation of China under Grant Nos TY7131008 and 513210902.
文摘Based on the generalized diffraction integral formula and the idea that the angle misalignment of the cat-eye optical lens can be transformed into the displacement misalignment,an approximate analytical propagation formula for Gaussian beams through a cat-eye optical lens under large incidence angle condition is derived.Numerical results show that the diffraction effect of the apertures of the cat-eye optical lens becomes stronger along with the increase in incidence angle.The results are also compared with those from using an angular spectrum diffraction integral and experiment to illustrate the applicability and validity of our theoretical formula.It is shown that the approximate extent is good enough for the application of a cat-eye optical lens with a radius of 20 mm and a propagation distance of 100 m,and the approximate extent becomes better along with the increase in the radius of the cat-eye optical lens and the propagation distance.
基金The project supported by the National Outstanding Youth Science Foundation of China the National Post Doctor Science Foundation of China
文摘In this paper, by means of combining non-probabilistic convex modeling with perturbation theory, an improvement is made on the first order approximate solution in convex models of uncertainties. Convex modeling is extended to largely uncertain and non-convex sets of uncertainties and the combinational convex modeling is developed. The presented method not only extends applications of convex modeling, but also improves its accuracy in uncertain problems and computational efficiency. The numerical example illustrates the efficiency of the proposed method.
基金supported by Ministry of Human Resource and Development(MHR-02-23-200-429/304)
文摘This paper has two sections which deals with a second order stochastic neutral partial differential equation with state dependent delay. In the first section the existence and uniqueness of mild solution is obtained by use of measure of non-compactness. In the second section the conditions for approximate controllability are investigated for the distributed second order neutral stochastic differential system with respect to the approximate controllability of the corresponding linear system in a Hilbert space. Our method is an extension of co-author N. Sukavanam’s novel approach in [22]. Thereby, we remove the need to assume the invertibility of a controllability operator used by authors in [5], which fails to exist in infinite dimensional spaces if the associated semigroup is compact. Our approach also removes the need to check the invertibility of the controllability Gramian operator and associated limit condition used by the authors in [20], which are practically difficult to verify and apply. An example is provided to illustrate the presented theory.
基金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.
