A novel method for simulating nuclear explosion with chemical explosion to form an approximate plane wave: Field test and numerical simulation

A nuclear explosion in the rock mass medium can produce strong shock waves,seismic shocks,and other destructive effects,which can cause extreme damage to the underground protection infrastructures.With the increase in nuclear explosion power,underground protection engineering enabled by explosion-proof impact theory and technology ushered in a new challenge.This paper proposes to simulate nuclear explosion tests with on-site chemical explosion tests in the form of multi-hole explosions.First,the mechanism of using multi-hole simultaneous blasting to simulate a nuclear explosion to generate approximate plane waves was analyzed.The plane pressure curve at the vault of the underground protective tunnel under the action of the multi-hole simultaneous blasting was then obtained using the impact test in the rock mass at the site.According to the peak pressure at the vault plane,it was divided into three regions:the stress superposition region,the superposition region after surface reflection,and the approximate plane stress wave zone.A numerical simulation approach was developed using PFC and FLAC to study the peak particle velocity in the surrounding rock of the underground protective cave under the action of multi-hole blasting.The time-history curves of pressure and peak pressure partition obtained by the on-site multi-hole simultaneous blasting test and numerical simulation were compared and analyzed,to verify the correctness and rationality of the formation of an approximate plane wave in the simulated nuclear explosion.This comparison and analysis also provided a theoretical foundation and some research ideas for the ensuing study on the impact of a nuclear explosion.

A Comparative Survey of an Approximate Solution Method for Stochastic Delay Differential Equations

This study is focused on the approximate solution for the class of stochastic delay differential equations. The techniques applied involve the use of Caratheodory and Euler Maruyama procedures which approximated to stochastic delay differential equations. Based on the Caratheodory approximate procedure, it was proved that stochastic delay differential equations have unique solution and established that the Caratheodory approximate solution converges to the unique solution of stochastic delay differential equations under the Cauchy sequence and initial condition. This Caratheodory approximate procedure and Euler method both converge at the same rate. This is achieved by replacing the present state with past state. The existence and uniqueness of an approximate solution of the stochastic delay differential equation were shown and the approximate solution to the unique solution was also shown. .

Vector Approximate Message Passing with Sparse Bayesian Learning for Gaussian Mixture Prior

Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate message passing(AMP)based algorithms have been proposed.For SBL,it has accurate performance with robustness while its computational complexity is high due to matrix inversion.For AMP,its performance is guaranteed by the severe restriction of the measurement matrix,which limits its application in solving CS problem.To overcome the drawbacks of the above algorithms,in this paper,we present a low complexity algorithm for the single linear model that incorporates the vector AMP(VAMP)into the SBL structure with expectation maximization(EM).Specifically,we apply the variance auto-tuning into the VAMP to implement the E step in SBL,which decrease the iterations that require to converge compared with VAMP-EM algorithm when using a Gaussian mixture(GM)prior.Simulation results show that the proposed algorithm has better performance with high robustness under various cases of difficult measurement matrices.

An Approximate Analytical Method for a Slot Ring Radome

In this paper,an in-band and out-of-band microwave wireless power-transmission characteristic analysis of a slot ring radome based on an approximate analytical method is proposed.The main contribution of this paper is that,in the approximate analysis of the ring radome,a unified expression of the incident field on the radome surface is derived with E-plane and H-plane scanning,and the ring is approximated as 30 segments of straight strips.Solving the corresponding 60×60 linear equations yields the electric current distribution along the ring strip.The magnetic current along the complementary slot ring is obtained by duality.Thanks to the fully analytical format of the current distribution,the microwave wireless power-transmission characteristics are efficiently calculated using Munk’s scheme.An example of a slot ring biplanar symmetric hybrid radome is used to verify the accuracy and efficiency of the proposed scheme.The central processing unit(CPU)time is about 690 s using Ansys HFSS software versus 2.82 s for the proposed method.

Approximate error correction scheme for three-dimensional surface codes based reinforcement learning

Quantum error correction technology is an important method to eliminate errors during the operation of quantum computers.In order to solve the problem of influence of errors on physical qubits,we propose an approximate error correction scheme that performs dimension mapping operations on surface codes.This error correction scheme utilizes the topological properties of error correction codes to map the surface code dimension to three dimensions.Compared to previous error correction schemes,the present three-dimensional surface code exhibits good scalability due to its higher redundancy and more efficient error correction capabilities.By reducing the number of ancilla qubits required for error correction,this approach achieves savings in measurement space and reduces resource consumption costs.In order to improve the decoding efficiency and solve the problem of the correlation between the surface code stabilizer and the 3D space after dimension mapping,we employ a reinforcement learning(RL)decoder based on deep Q-learning,which enables faster identification of the optimal syndrome and achieves better thresholds through conditional optimization.Compared to the minimum weight perfect matching decoding,the threshold of the RL trained model reaches 0.78%,which is 56%higher and enables large-scale fault-tolerant quantum computation.

Existence of Approximate Solutions to Nonlinear Lorenz System under Caputo-Fabrizio Derivative

In this article,we developed sufficient conditions for the existence and uniqueness of an approximate solution to a nonlinear system of Lorenz equations under Caputo-Fabrizio fractional order derivative(CFFD).The required results about the existence and uniqueness of a solution are derived via the fixed point approach due to Banach and Krassnoselskii.Also,we enriched our work by establishing a stable result based on the Ulam-Hyers(U-H)concept.Also,the approximate solution is computed by using a hybrid method due to the Laplace transform and the Adomian decomposition method.We computed a few terms of the required solution through the mentioned method and presented some graphical presentation of the considered problem corresponding to various fractional orders.The results of the existence and uniqueness tests for the Lorenz system under CFFD have not been studied earlier.Also,the suggested method results for the proposed system under the mentioned derivative are new.Furthermore,the adopted technique has some useful features,such as the lack of prior discrimination required by wavelet methods.our proposed method does not depend on auxiliary parameters like the homotopy method,which controls the method.Our proposed method is rapidly convergent and,in most cases,it has been used as a powerful technique to compute approximate solutions for various nonlinear problems.

An Optimized Deep-Learning-Based Low Power Approximate Multiplier Design

Approximate computing is a popularfield for low power consumption that is used in several applications like image processing,video processing,multi-media and data mining.This Approximate computing is majorly performed with an arithmetic circuit particular with a multiplier.The multiplier is the most essen-tial element used for approximate computing where the power consumption is majorly based on its performance.There are several researchers are worked on the approximate multiplier for power reduction for a few decades,but the design of low power approximate multiplier is not so easy.This seems a bigger challenge for digital industries to design an approximate multiplier with low power and minimum error rate with higher accuracy.To overcome these issues,the digital circuits are applied to the Deep Learning(DL)approaches for higher accuracy.In recent times,DL is the method that is used for higher learning and prediction accuracy in severalfields.Therefore,the Long Short-Term Memory(LSTM)is a popular time series DL method is used in this work for approximate computing.To provide an optimal solution,the LSTM is combined with a meta-heuristics Jel-lyfish search optimisation technique to design an input aware deep learning-based approximate multiplier(DLAM).In this work,the jelly optimised LSTM model is used to enhance the error metrics performance of the Approximate multiplier.The optimal hyperparameters of the LSTM model are identified by jelly search opti-misation.Thisfine-tuning is used to obtain an optimal solution to perform an LSTM with higher accuracy.The proposed pre-trained LSTM model is used to generate approximate design libraries for the different truncation levels as a func-tion of area,delay,power and error metrics.The experimental results on an 8-bit multiplier with an image processing application shows that the proposed approx-imate computing multiplier achieved a superior area and power reduction with very good results on error rates.

A new method to obtain approximate symmetry of nonlinear evolution equation from perturbations

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.

Approximate homotopy similarity reduction for the generalized Kawahara equation via Lie symmetry method and direct method

This paper studies the generalized Kawahara equation in terms of the approximate homotopy symmetry method and the approximate homotopy direct method. Using both methods it obtains the similarity reduction solutions and similarity reduction equations of different orders, showing that the approximate homotopy direct method yields more general approximate similarity reductions than the approximate homotopy symmetry method. The homotopy series solutions to the generalized Kawahara equation are consequently derived.

A Class of Generalized Approximate Inverse Solvers for Unsymmetric Linear Systems of Irregular Structure Based on Adaptive Algorithmic Modelling for Solving Complex Computational Problems in Three Space Dimensions

A class of general inverse matrix techniques based on adaptive algorithmic modelling methodologies is derived yielding iterative methods for solving unsymmetric linear systems of irregular structure arising in complex computational problems in three space dimensions. The proposed class of approximate inverse is chosen as the basis to yield systems on which classic and preconditioned iterative methods are explicitly applied. Optimized versions of the proposed approximate inverse are presented using special storage (k-sweep) techniques leading to economical forms of the approximate inverses. Application of the adaptive algorithmic methodologies on a characteristic nonlinear boundary value problem is discussed and numerical results are given.

APPROXIMATE DUALITY OF g-FRAMES IN HILBERT SPACES

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.

Application of approximate entropy on dynamic characteristics of epileptic absence seizure

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.

A simplified approximate model of compressible hypervelocity penetration

A simplified approximate model considering rod/target material's compressibility is proposed for hypervelocity penetration.We study the effect of shockwaves on hypervelocity penetration whenever the compressibility of the rod is much larger,analogously,and much less than that of the target,respectively.The results show that the effect of shockwaves is insignificant up to 12 km/s,so the shockwave is neglected in the present approximate model.The Murnaghan equation of state is adopted to simulate the material behaviors in penetration and its validity is proved.The approximate model is finally reduced to an equation depending only on the penetration velocity and a simple approximate solution is achieved.The solution of the approximate model is in agreement with the result of the complete compressible model.In addition,the effect of shockwaves on hypervelocity penetration is shown to weaken material's compressibility and reduce the interface pressure of the rod/target,and thus the striking/protective performance of the rod/target is weakened,respectively.We also conduct an error analysis of the interface pressure and penetration efficiency.With a velocity change of 1.6 times the initial sound speed for the rod or target,the error of the approximate model is very small.For metallic rod-target combinations,the approximate model is applicable even at an impact velocity of 12 km/s.

An Approximate Analytical Propagation Formula for Gaussian Beams through a Cat-Eye Optical Lens under Large Incidence Angle Condition

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.

Using approximate dynamic programming for multi-ESM scheduling to track ground moving targets

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.

Approximate solutions of the Alekseevskii–Tate model of long-rod penetration

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.

Fully implicational methods for approximate reasoning based on interval-valued fuzzy sets

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.

EXISTENCE OF SOLUTION AND APPROXIMATE CONTROLLABILITY OF A SECOND-ORDER NEUTRAL STOCHASTIC DIFFERENTIAL EQUATION WITH STATE DEPENDENT DELAY

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.

Approximate entropy and support vector machines for electroencephalogram signal classification

The automatic detection and identification of electroencephalogram waves play an important role in the prediction, diagnosis and treatment of epileptic seizures. In this study, a nonlinear dynamics index–approximate entropy and a support vector machine that has strong generalization ability were applied to classify electroencephalogram signals at epileptic interictal and ictal periods. Our aim was to verify whether approximate entropy waves can be effectively applied to the automatic real-time detection of epilepsy in the electroencephalogram, and to explore its generalization ability as a classifier trained using a nonlinear dynamics index. Four patients presenting with partial epileptic seizures were included in this study. They were all diagnosed with neocortex localized epilepsy and epileptic foci were clearly observed by electroencephalogram. The electroencephalogram data form the four involved patients were segmented and the characteristic values of each segment, that is, the approximate entropy, were extracted. The support vector machine classifier was constructed with the approximate entropy extracted from one epileptic case, and then electroencephalogram waves of the other three cases were classified, reaching a 93.33% accuracy rate. Our findings suggest that the use of approximate entropy allows the automatic real-time detection of electroencephalogram data in epileptic cases. The combination of approximate entropy and support vector machines shows good generalization ability for the classification of electroencephalogram signals for epilepsy.

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.