Evolutionary Safe Padé Approximation Scheme for Dynamical Study of Nonlinear Cervical Human Papilloma Virus Infection Model

This study proposes a structure-preserving evolutionary framework to find a semi-analytical approximate solution for a nonlinear cervical cancer epidemic(CCE)model.The underlying CCE model lacks a closed-form exact solution.Numerical solutions obtained through traditional finite difference schemes do not ensure the preservation of the model’s necessary properties,such as positivity,boundedness,and feasibility.Therefore,the development of structure-preserving semi-analytical approaches is always necessary.This research introduces an intelligently supervised computational paradigm to solve the underlying CCE model’s physical properties by formulating an equivalent unconstrained optimization problem.Singularity-free safe Padérational functions approximate the mathematical shape of state variables,while the model’s physical requirements are treated as problem constraints.The primary model of the governing differential equations is imposed to minimize the error between approximate solutions.An evolutionary algorithm,the Genetic Algorithm with Multi-Parent Crossover(GA-MPC),executes the optimization task.The resulting method is the Evolutionary Safe PadéApproximation(ESPA)scheme.The proof of unconditional convergence of the ESPA scheme on the CCE model is supported by numerical simulations.The performance of the ESPA scheme on the CCE model is thoroughly investigated by considering various orders of non-singular Padéapproximants.

Determining Hubbard U of VO_(2) by the quasi-harmonic approximation

Vanadium dioxide VO_(2) is a strongly correlated material that undergoes a metal-to-insulator transition around 340 K.In order to describe the electron correlation effects in VO_(2), the DFT+U method is commonly employed in calculations.However, the choice of the Hubbard U parameter has been a subject of debate and its value has been reported over a wide range. In this paper, taking focus on the phase transition behavior of VO_(2), the Hubbard U parameter for vanadium oxide is determined by using the quasi-harmonic approximation(QHA). First-principles calculations demonstrate that the phase transition temperature can be modulated by varying the U values. The phase transition temperature can be well reproduced by the calculations using the Perdew–Burke–Ernzerhof functional combined with the U parameter of 1.5eV. Additionally,the calculated band structure, insulating or metallic properties, and phonon dispersion with this U value are in line with experimental observations. By employing the QHA to determine the Hubbard U parameter, this study provides valuable insights into the phase transition behavior of VO_(2). The findings highlight the importance of electron correlation effects in accurately describing the properties of this material. The agreement between the calculated results and experimental observations further validates the chosen U value and supports the use of the DFT+U method in studying VO_(2).

Saddlepoint Approximation Method in Reliability Analysis:A Review

The escalating need for reliability analysis(RA)and reliability-based design optimization(RBDO)within engineering challenges has prompted the advancement of saddlepoint approximationmethods(SAM)tailored for such problems.This article offers a detailed overview of the general SAM and summarizes the method characteristics first.Subsequently,recent enhancements in the SAM theoretical framework are assessed.Notably,the mean value first-order saddlepoint approximation(MVFOSA)bears resemblance to the conceptual framework of the mean value second-order saddlepoint approximation(MVSOSA);the latter serves as an auxiliary approach to the former.Their distinction is rooted in the varying expansion orders of the performance function as implemented through the Taylor method.Both the saddlepoint approximation and third-moment(SATM)and saddlepoint approximation and fourth-moment(SAFM)strategies model the cumulant generating function(CGF)by leveraging the initial random moments of the function.Although their optimal application domains diverge,each method consistently ensures superior relative precision,enhanced efficiency,and sustained stability.Every method elucidated is exemplified through pertinent RA or RBDO scenarios.By juxtaposing them against alternative strategies,the efficacy of these methods becomes evident.The outcomes proffered are subsequently employed as a foundation for contemplating prospective theoretical and practical research endeavors concerning SAMs.The main purpose and value of this article is to review the SAM and reliability-related issues,which can provide some reference and inspiration for future research scholars in this field.

Gamma Approximation Based Multi-Antenna Covert Communication Detection

Covert communication technology makes wireless communication more secure,but it also provides more opportunities for illegal users to transmit harmful information.In order to detect the illegal covert communication of the lawbreakers in real time for subsequent processing,this paper proposes a Gamma approximation-based detection method for multi-antenna covert communication systems.Specifically,the Gamma approximation property is used to calculate the miss detection rate and false alarm rate of the monitor firstly.Then the optimization problem to minimize the sum of the missed detection rate and the false alarm rate is proposed.The optimal detection threshold and the minimum error detection probability are solved according to the properties of the Lambert W function.Finally,simulation results are given to demonstrate the effectiveness of the proposed method.

Relaxed Stability Criteria for Time-Delay Systems:A Novel Quadratic Function Convex Approximation Approach

This paper develops a quadratic function convex approximation approach to deal with the negative definite problem of the quadratic function induced by stability analysis of linear systems with time-varying delays.By introducing two adjustable parameters and two free variables,a novel convex function greater than or equal to the quadratic function is constructed,regardless of the sign of the coefficient in the quadratic term.The developed lemma can also be degenerated into the existing quadratic function negative-determination(QFND)lemma and relaxed QFND lemma respectively,by setting two adjustable parameters and two free variables as some particular values.Moreover,for a linear system with time-varying delays,a relaxed stability criterion is established via our developed lemma,together with the quivalent reciprocal combination technique and the Bessel-Legendre inequality.As a result,the conservatism can be reduced via the proposed approach in the context of constructing Lyapunov-Krasovskii functionals for the stability analysis of linear time-varying delay systems.Finally,the superiority of our results is illustrated through three numerical examples.

An Overview of Sequential Approximation in Topology Optimization of Continuum Structure

This paper offers an extensive overview of the utilization of sequential approximate optimization approaches in the context of numerically simulated large-scale continuum structures.These structures,commonly encountered in engineering applications,often involve complex objective and constraint functions that cannot be readily expressed as explicit functions of the design variables.As a result,sequential approximation techniques have emerged as the preferred strategy for addressing a wide array of topology optimization challenges.Over the past several decades,topology optimization methods have been advanced remarkably and successfully applied to solve engineering problems incorporating diverse physical backgrounds.In comparison to the large-scale equation solution,sensitivity analysis,graphics post-processing,etc.,the progress of the sequential approximation functions and their corresponding optimizersmake sluggish progress.Researchers,particularly novices,pay special attention to their difficulties with a particular problem.Thus,this paper provides an overview of sequential approximation functions,related literature on topology optimization methods,and their applications.Starting from optimality criteria and sequential linear programming,the other sequential approximate optimizations are introduced by employing Taylor expansion and intervening variables.In addition,recent advancements have led to the emergence of approaches such as Augmented Lagrange,sequential approximate integer,and non-gradient approximation are also introduced.By highlighting real-world applications and case studies,the paper not only demonstrates the practical relevance of these methods but also underscores the need for continued exploration in this area.Furthermore,to provide a comprehensive overview,this paper offers several novel developments that aim to illuminate potential directions for future research.

Nonlinear Filtering With Sample-Based Approximation Under Constrained Communication:Progress, Insights and Trends

The nonlinear filtering problem has enduringly been an active research topic in both academia and industry due to its ever-growing theoretical importance and practical significance.The main objective of nonlinear filtering is to infer the states of a nonlinear dynamical system of interest based on the available noisy measurements. In recent years, the advance of network communication technology has not only popularized the networked systems with apparent advantages in terms of installation,cost and maintenance, but also brought about a series of challenges to the design of nonlinear filtering algorithms, among which the communication constraint has been recognized as a dominating concern. In this context, a great number of investigations have been launched towards the networked nonlinear filtering problem with communication constraints, and many samplebased nonlinear filters have been developed to deal with the highly nonlinear and/or non-Gaussian scenarios. The aim of this paper is to provide a timely survey about the recent advances on the sample-based networked nonlinear filtering problem from the perspective of communication constraints. More specifically, we first review three important families of sample-based filtering methods known as the unscented Kalman filter, particle filter,and maximum correntropy filter. Then, the latest developments are surveyed with stress on the topics regarding incomplete/imperfect information, limited resources and cyber security.Finally, several challenges and open problems are highlighted to shed some lights on the possible trends of future research in this realm.

Wave equation tomographic velocity inversion method based on the Born/Rytov approximation

This paper discusses Born/Rytov approximation tomographic velocity inversion methods constrained by the Fresnel zone. Calculations of the sensitivity kernel function and traveltime residuals are critical in tomographic velocity inversion. Based on the Bom/Rytov approximation of the frequency-domain wave equation, we derive the traveltime sensitivity kemels of the wave equation on the band-limited wave field and simultaneously obtain the traveltime residuals based on the Rytov approximation. In contrast to single-ray tomography, the modified velocity inversion method improves the inversion stability. Tests of the near- surface velocity model and field data prove that the proposed method has higher accuracy and Computational efficiency than ray theory tomography and full waveform inversion methods.

APPROXIMATION TECHNIQUES FOR APPLICATION OF GENETIC ALGORITHMS TO STRUCTURAL OPTIMIZATION

Although the genetic algorithm (GA) has very powerful robustness and fitness, it needs a large size of population and a large number of iterations to reach the optimum result. Especially when GA is used in complex structural optimization problems, if the structural reanalysis technique is not adopted, the more the number of finite element analysis (FEA) is, the more the consuming time is. In the conventional structural optimization the number of FEA can be reduced by the structural reanalysis technique based on the approximation techniques and sensitivity analysis. With these techniques, this paper provides a new approximation model-segment approximation model, adopted for the GA application. This segment approximation model can decrease the number of FEA and increase the convergence rate of GA. So it can apparently decrease the computation time of GA. Two examples demonstrate the availability of the new segment approximation model.

Strong Uniqueness of Best Approximations from RS-sets in Banach Spaces

The problem of strong uniqueness of best approximation from an RS set in a Banach space is considered. For a fixed RS set G and an element x∈X , we proved that the best approximation g * to x from G is strongly unique.

The Order of Approximation by Complex Rational Type Interpolating Operators at Fejer's Points

In this paper, supose Γ be a boundary of a Jordan domain D and Γ satisfied Альпер condition, the order that rational type interpolating operators at Fejer's points of f(z)∈C(Γ) converge to f(z) in the sense of uniformly convergence is obtained.

Capacitor self-calibration technique used in time-interleaved successive approximation ADC

A capacitor self-calibration circuit used in a successive approximation analog-to-digital converter （SA-ADC） is presented. This capacitor self-calibration circuit can calibrate erroneous data and work with the ADC by adding an additional clock period. This circuit is used in a 10 bit 32 Msample/s time-interleaved SA- ADC. The chip is implemented with Chart 0. 25 μm 2. 5 V process and totally occupies an area of 1.4 mm× 1.3 mm. After calibration, the simulated signal-to-noise ratio （SNR） is 59. 586 1 dB and the spurious-free dynamic range （SFDR） is 70. 246 dB at 32 MHz. The measured signal-to-noise and distortion ratio （SINAD） is 44. 82 dB and the SFDR is 63. 760 4 dB when the ADC samples a 5.8 MHz sinusoid wave.

IMPROVED AERODYNAMIC APPROXIMATION MODEL WITH CASE-BASED REASONING TECHNIQUE FOR MDO OF AIRCRAFT

To increase the efficiency of the multidisciplinary optimization of aircraft, an aerodynamic approximation model is improved. Based on the study of aerodynamic approximation model constructed by the scaling correction model, case-based reasoning technique is introduced to improve the approximation model for optimization. The aircraft case model is constructed by utilizing the plane parameters related to aerodynamic characteristics as attributes of cases, and the formula of case retrieving is improved. Finally, the aerodynamic approximation model for optimization is improved by reusing the correction factors of the most similar aircraft to the current one. The multidisciplinary optimization of a civil aircraft concept is carried out with the improved aerodynamic approximation model. The results demonstrate that the precision and the efficiency of the optimization can be improved by utilizing the improved aerodynamic approximation model with ease-based reasoning technique.

APPROXIMATION OF INTERVAL BEZIER SURFACES

Based on the conception of perturbation, an approach to the interval Bezier surfaces approximating ra- tional surfaces is presented using the energy minimization method. The method places more restrictions on the perturbation surfaces than the original surfaces. The applications of the approach are also presented. Experimen- tal result is combined with the subdivision method to obtain a piecewise interval polynomial approximation for a rational surface.

Simultaneous Approximation by Baskakov-Durrmeyer Operator

In this paper, we investigate the degree of approximation by Baskakov_Durrmeyer operator for functions which derivatives have only discontinuity points of the first kind on [0,∞) with exponential growth.

BEST APPROXIMATION BY NORMAL MATRICES WITH SPECTRAL CONSTRAINTS

The problem of best approximating, a given square complex matrix in the Frobenius norm by normal matrices under a given spectral restriction is considered. The ne cessary and sufficient condition for the solvability of the problem is given. A numerical algorithm for solving the problem is provided and a numerical example is presented.

Parameter selection of support vector machine for function approximation based on chaos optimization

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.

QSPR modeling of azeotropic temperatures and compositions for binary azeotropes containing lower alcohols using a genetic function approximation

Binary azeotropes, which contain two chemicals with a relative volatility of 1, are very common in the chemical industry. Understanding azeotropes is essential for effectively separating binary azeotropes containing lower alcohols. Experimental techniques and ab initio approaches can produce accurate results;however, these two processes are time consuming and labor intensive. Although thermodynamic equations such as UNIFAC are widely used, experimental values are required, and it is difficult to choose the best groups to represent a complex system. Because of their high efficiency and fast calculation speed, quantitative structure–property relationship(QSPR) tools were used in this work to predict the azeotropic temperatures and compositions of binary azeotropes containing lower alcohols. The QSPR models for 64 binary azeotropes based on centroid approximation and weighted-contribution-factor approximation were established using the genetic function approximation(GFA) procedure in Materials Studio software, and a leave-one-out cross-validation procedure was conducted.External tests of an additional 16 azeotropes were also investigated, and high determination coefficient values were obtained. The best QSPR models were explained in terms of the molecular structure of the azeotropes,and good predictive ability was obtained within acceptable prediction error levels.

Carlson iterating rational approximation and performance analysis of fractional operator with arbitrary order

The performance analysis of the generalized Carlson iterating process,which can realize the rational approximation of fractional operator with arbitrary order,is presented in this paper.The reasons why the generalized Carlson iterating function possesses more excellent properties such as self-similarity and exponential symmetry are also explained.K-index,P-index,O-index,and complexity index are introduced to contribute to performance analysis.Considering nine different operational orders and choosing an appropriate rational initial impedance for a certain operational order,these rational approximation impedance functions calculated by the iterating function meet computational rationality,positive reality,and operational validity.Then they are capable of having the operational performance of fractional operators and being physical realization.The approximation performance of the impedance function to the ideal fractional operator and the circuit network complexity are also exhibited.

Operators of Approximations and Approximate Power Set Spaces

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.