Search

This paper focuses on developing and analyzing a new AR-iterative scheme designed for estimating fixed points of generalized non-expansive mappings of the Suzuki kind. The scheme’s stability and convergence properties are rigorously proven, highlighting its superior convergence rate for non-expansive mappings when compared to existing schemes in the literature. Additionally, an application of the AR-iterative scheme to differential equations is presented. These findings underscore the effectiveness and versatility of the proposed scheme in numerical analysis and computational mathematics. [ABSTRACT FROM AUTHOR]

This contribution discusses the influence of different barrier update strategies on the performance and robustness of an interior point algorithm for single-crystal plasticity at small strains. To this end, single-crystal plasticity is first briefly presented in the framework of a primal-dual interior point algorithm to outline the general algorithmic structure. The manner in which the barrier parameter is modified within the interior point method, steering the penalization of constraints, plays a crucial role for the robustness and efficiency of the overall algorithm. In this paper, we compare and analyze different strategies in the framework of crystal plasticity. In a thorough analysis of a numerical example covering a broad range of settings in monocrystals, we investigate robust hyperparameter ranges and identify the most efficient and robust barrier parameter update strategies. [ABSTRACT FROM AUTHOR]

This work explores a well-established eighth-algebraic-order numerical method belonging to the explicit Numerov-type family. To enhance its efficiency, we integrated a cost-effective algorithm for adjusting the step size. After each step, the algorithm either maintains the current step length, halves it, or doubles it. Any off-step points required by this technique are calculated using a local interpolation function. Numerical tests involving diverse problems demonstrate the significant efficiency improvements achieved through this approach. The method is particularly effective for solving differential equations with oscillatory behavior, showcasing its ability to maintain high accuracy with fewer function evaluations. This advancement is crucial for applications requiring precise solutions over long intervals, such as in physics and engineering. Additionally, the paper provides a comprehensive MATLAB-R2018a implementation, facilitating ease of use and further research in the field. By addressing both computational efficiency and accuracy, this study contributes a valuable tool for the numerical analysis community. [ABSTRACT FROM AUTHOR]

Abstract: In a recent paper (Computer Aided Geometric Design 23 (3), 243–260), Yang presented a novel kind of nonlinear and geometry driven subdivision scheme for curve interpolation. The author declared that this scheme was shape preserving when all free parameters were explicitly selected by some specific rules. In this note, we demonstrate that the author (a) ignored the consistency of the definition to straight edges, and also (b) did not give a perfect scheme and proof for the shape preserving subdivision. [Copyright &y& Elsevier]

This paper proposes an L1/LDG algorithm for a time–space fractional convection equation on a bounded rectangular domain Ω⊂ℝ2$$ \Omega \subset {\mathrm{\mathbb{R}}}^2 $$. Here, the temporal partial derivative is in the sense of Caputo with order α∈(0,1)$$ \alpha \in \left(0,1\right) $$, and the spatial partial derivatives are of Riesz type with orders β,γ∈(0,1)$$ \beta, \gamma \in \left(0,1\right) $$ in x$$ x $$‐ and y$$ y $$‐directions, respectively. L1 approximation is utilized to evaluate the temporal Caputo derivative, while the local discontinuous Galerkin (LDG) method is adopted to deal with the spatial Riesz derivative. The rigorous numerical stability analysis and error estimate are presented which are supported by illustrative numerical examples. [ABSTRACT FROM AUTHOR]

The simulation of slowly varying electromagnetic fields is possible for very large, realistic problems with finite-difference implicit time-domain (FDiTD) and frequency-domain (FDFD) formulations on the basis of the consistent Finite-Integration Technique (FIT). Magneto-quasistatic time-domain formulations combined with implicit time marching schemes require the repeated solution of real-valued symmetric systems. The solution of driven frequency domain problems usually consists in the solution of one non-Hermitean system. Preconditioned conjugate gradient-type methods are well-suited for this task. They allow the efficient solution even for consistent singular or near-singular systems, which typically arise from formulations for slowly varying electromagnetic fields using the Maxwell-Grid-Equations of the FI-Method. Numerical results for TEAM workshop 11 benchmark problem and for a large practical problem, a shading ring sensor, show that the presented algorithms are capable of solving realistic problems for large numbers of unknowns in acceptable calculation times on contemporary medium sized workstations. Copyright © 1999 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In this paper, we propose two new hybrid methods for solving nonlinear equations, utilizing the advantages of classical methods (bisection, trisection, and modified false position), i.e., bisection-modified false position (Bi-MFP) and trisection-modified false position (Tri-MFP). We implemented the proposed algorithms for several benchmark problems. We discuss the graphical analysis of these problems with respect to the number of iterations and the average CPU time. [ABSTRACT FROM AUTHOR]

This paper proposed an efficient and adaptive frequency sampling algorithm for frequency response analysis using dynamic condensation-based reduced-order modeling. For the degree of freedom-based model reduction method, the reduced-order basis becomes a frequency-dependent matrix since the relationship between master and slave degrees of freedom stems from partial equations of a second-order dynamical system. Such frequency-dependency makes the analysis inefficient for investigating the frequency response of the system. Considering that the coverage of a local reduced-order basis at a single frequency varies depending on the frequency, a new frequency sampling algorithm was proposed with a strategy of constructing multiple local reduced-order models (ROMs) at sample frequencies. For adaptive sampling, the frequency range of a local ROM was evaluated, and a new sample was added if there was a gap between two adjacent ROMs. As a result, the accuracy of the local ROM can be estimated, and the efficiency in the online stage was greatly enhanced. The proposed method was verified by performing frequency response analysis with several numerical examples, including a large-scale structural and dynamic system. [ABSTRACT FROM AUTHOR]

In ultra-high-field (UHF) magnetic resonance imaging (MRI) applications, the design and analysis of high-frequency radio frequency (RF) coils requires full-wave electromagnetic (EM) methods that can handle complex field-tissue interactions. Using a Huygens' equivalent surface, the Method of Moments (MoM) and the Finite-Difference Time-Domain (FDTD) algorithm can be combined to accurately model the high-frequency RF coils. In previous research, a uniform FDTD mesh structure was considered, providing a compromised solution for coil-tissue interactions. This paper proposes a hybrid FDTD/MoM algorithm with non-uniform meshes. The fine mesh domain is set at the Huygens' surface, and the other domain uses coarse meshes. The proposed algorithms are strictly validated, and their computational performance is compared against conventional methods. Results show that the new algorithm can improve the calculation efficiency without losing accuracy. Specifically, compared with the uniform FDTD method, the numerical difference between both hybrid methods remains at 3.2%. Still, the calculation time of the non-uniform grid algorithm is reduced by 64.2%, demonstrating the effectiveness of the new algorithm for modeling RF coils for UHF-MRI applications. [ABSTRACT FROM AUTHOR]

In recent years, sparse recovery-based space-time adaptive processing (SR-STAP) technique has exhibited excellent performance with insufficient samples. Sparse Bayesian learning algorithms have received considerable attention for their remarkable and reliable performance. Its implementation in large-scale radar systems is however hindered by the overwhelming computational load and slow convergence speed. This paper aims to address these drawbacks by proposing an improved iterative reweighted sparse Bayesian learning algorithm based on expansion-compression variance-components (ExCoV-IIR-MSBL). Firstly, a modified Bayesian probabilistic model for SR-STAP is introduced. Exploiting the intrinsic sparsity prior of the clutter, we divide the space-time coefficients into two parts: the significant part with nontrivial coefficients and the irrelevant part with small or zero coefficients. Meanwhile, we only assign independent hyperparameters to the coefficients in the significant part, while the remaining coefficients share a common hyperparameter. Then the generalized maximum likelihood (GML) criterion is adopted to classify the coefficients, ensuring both accuracy and efficiency. Hence, the parameter space in Bayesian inference will be significantly reduced, and the computational efficiency can be considerably promoted. Both theoretical analysis and numerical experiments validate that the proposed algorithm achieves superior performance with considerably improved computational efficiency in sample shortage scenarios. [ABSTRACT FROM AUTHOR]

In this paper, we are interested in finding a numerical solution of a linear BVP for a Fredholm IDE with a degenerate kernel subjected to impulsive actions. By Dzumabaev's parametrization method the original problem is reduced to a multipoint BVP for the system of Fredholm IDEs with additional parameters. For fixed parameters, the special Cauchy problem for the system of FIDEs on subintervals is obtained and by using a solution to this problem, a system of algebraic equations in parameters is constructed. An algorithm for solving the BVP and its computational implementation is developed. In the algorithm, Cauchy problems for ODEs and the calculation of definite integrals are the main auxiliary problems. By using various numerical methods for solving these auxiliary problems, the proposed algorithm can be implemented in different ways. The program codes were written to solve the problem and all calculations are performed on the Matlab 2018 software platform. [ABSTRACT FROM AUTHOR]

The state of health (SOH) of power battery reflects the difference between the current performance of the battery and the time it left the factory. Accurate prediction of it is the key to improving battery cycle efficiency. This paper studies the application of data-driven algorithms in power battery health estimation. Firstly, Using the data of actual operating vehicles which are monitoring in the data platform as the research objects. The charging event segmentation algorithm is designed for the full amount of data, and the K-means clustering model is used to extract slow charging events. Secondly, feature engineering is performed on the data, including the use of Pearson and Spearman coefficients analysis for numerical features, the use of one-hot encoding for category features to determine the final input features of SOH model. Eventually, using the Ridge linear regression model to predict the health status of the power battery. The research shows that the MAE is less than 5%, which meets the needs of practical use. In addition, this paper comparing Ridge with three other models named Linear Regression, Lasso, and Elastic Net. The result showed that the linear regression model with L2 regularization is more applicable in low-dimensional feature application scenarios without cell data in prediction of SOH. [ABSTRACT FROM AUTHOR]

• Investigate assigning shipping requests to crowdsourcees with time and capacity constraints • Propose a centralized, deep reinforcement learning-based approach • Present new state space representation encompassing spatial-temporal and capacity information • Embed heuristics-guided action choice in DRL to preserve tractability and enhance efficiency • Integrate rule-interposing into DRL to further enhance training and implementation efficiency This paper investigates the problem of assigning shipping requests to ad hoc couriers in the context of crowdsourced urban delivery. The shipping requests are spatially distributed each with a limited time window between the earliest time for pickup and latest time for delivery. The ad hoc couriers, termed crowdsourcees, also have limited time availability and carrying capacity. We propose a new deep reinforcement learning (DRL)-based approach to tackling this assignment problem. A deep Q network (DQN) algorithm is trained which entails two salient features of experience replay and target network that enhance the efficiency, convergence, and stability of DRL training. More importantly, this paper makes three methodological contributions: 1) presenting a comprehensive and novel characterization of crowdshipping system states that encompasses spatial-temporal and capacity information of crowdsourcees and requests; 2) embedding heuristics that leverage information offered by the state representation and are based on intuitive reasonings to guide specific actions to take, to preserve tractability and enhance efficiency of training; and 3) integrating rule-interposing to prevent repeated visiting of the same routes and node sequences during routing improvement, thereby further enhancing the training efficiency by accelerating learning. The computational complexities of the heuristics and the overall DQN training are investigated. The effectiveness of the proposed approach is demonstrated through extensive numerical analysis. The results show the benefits brought by the heuristics-guided action choice, rule-interposing, and having time-related information in the state space in DRL training, the near-optimality of the solutions obtained, and the superiority of the proposed approach over existing methods in terms of solution quality, computation time, and scalability. [ABSTRACT FROM AUTHOR]

The simulation of rubber-like materials is usually based on hyperelasticity. If strain-rate dependency has to be considered viscous dampers also have to be taken into account in the rheological model. A disadvantage of such a description is time-consuming parameter identification associated with the damping constants. In this paper, a tabulated formulation is presented which allows the fast generation of input data based on uniaxial static and dynamic tensile tests at different strain rates. Unloading, i.e. forming a hysteresis loop, can also be modeled easily based on a damage formulation. We show the theoretical background and algorithmic setup of our model that has been implemented in the explicit finite element program LS-DYNA [1-3]. Apart from purely numerical examples, the validation of a soft and a hard rubber under loading and subsequent unloading at different strain rates is shown. [ABSTRACT FROM AUTHOR]

The problem of interest in this paper is the mathematical and numerical analysis of a new non-variational model based on a high order non-linear PDE system resulting from image denoising. This model is motivated by involving the decomposition approach of H − 1 norm suggested by Guo et al. [1,2] which is more appropriate to represent the small details in the textured image. Our model is based on a diffusion tensor that improves the behavior of the Perona-Malik diffusion directions in homogeneous regions and the Weickert model near tiny edges with a high diffusion order. A rigorous analysis of the existence and uniqueness of the weak solution of the proposed reaction-diffusion model is cheked in a suitable functional framework, using the Schauder fixed point theorem. Finally, we carry out a numerical result to show the effectiveness of our model by comparing the results obtained with some competitive models. [ABSTRACT FROM AUTHOR]

In many areas, such as simulation, numerical analysis, computer programming, decision-making, entertainment, and coding, a random number input is required. The pseudo-random number uses its seed value. In this paper, a hybrid method for pseudo number generation is proposed using Linear Feedback Shift Registers (LFSR) and Linear Congruential Generator (LCG). The hybrid method for generating keys is proposed by merging technologies. In each method, a new large in key-space group of numbers were generated separately. Also, a higher level of secrecy is gained such that the internal numbers generated from LFSR are combined with LCG (The adoption of roots in non-linear iteration loops). LCG and LFSR are linear structures and outputs of these Random Number Generators (RNGs) are predictable, while the proposal avoids this predictable nature. The results were tested in terms of randomness, in terms of the correlation between the keys and the effect of changing the initial state on the generated keys and the results of the tests showed that they had successfully passed the tests and resist brute force and differential attack. [ABSTRACT FROM AUTHOR]

• Numerical methods used for the estimation of the RMS. • Simpson's 1/3 rule and Simpson's 3/8 rule modified for the purpose of general application. • Modified Simpson's rules do not necessitate more complex mathematical calculations than those used in the existing methods. • Modifications provide better measurement results for some a lower ratio of the frequency of sampling and the frequency of the signal. • Modified methods do not require the manufacturers of commercial measurement equipment to additionally invest in it. This paper demonstrates that direct changes in the algorithm for the estimation of the root mean square value of a voltage signal of an arbitrary waveform can lead to improved performances and lower measurement uncertainty of commercially available instruments without requiring any upgrade of their existing hardware. The research conducted and presented here is an original contribution to the development of estimation techniques and mathematical models for measurement oriented purposes regardless of the number of samples in the given period relying on mathematical calculation of the equal complexity as in the methods already in use. The theoretical approach examines the problem of numerical integration focusing on modified Simpson's 1/3 rule and modified Simpson's 3/8 rule used for the purpose of the estimation of the root mean square value when a small number of samples per period is available. It highlights the limitations of Simpson's 1/3 rule and Simpson's 3/8 rule, and shows that the newly proposed algorithm is optimal with respect to measurement accuracy and precision even in cases when the ratio of the sampling frequency and the signal's fundamental frequency is low. All theoretical results have been validated experimentally. [ABSTRACT FROM AUTHOR]

The continuous Lambertian shape from shading is studied using a PDE approach in terms of Hamilton–Jacobi equations. The latter will then be characterized by a maximization problem. In this paper we show the convergence of discretization and propose to use the well-known Chambolle–Pock primal-dual algorithm to solve numerically the shape from shading problem. The saddle-point structure of the problem makes the Chambolle–Pock algorithm suitable to approximate solutions of the discretized problems. [ABSTRACT FROM AUTHOR]

This paper presents a new numerical method to solve the non-linear constitutive equations of viscoelastic string with variable fractional order model. Firstly, the non-linear constitutive equation of the string is established based on the variable fractional viscoelastic model. Secondly, non-linear constitutive equation of the string is transformed into a matrix equation by using Bernstein polynomials, which can greatly simplify the solving process. Then the matrix equation is discretized and solved to obtain the numerical solutions. Finally, numerical results of viscoelastic string show the effect of the axial tension and axial velocity on its displacement, velocity and acceleration. It also indicates that how dynamic behaviours are affected by external force excitation. In addition, the proposed algorithm shows enormous potentials for solving the problem of high precision dynamics with the variable fractional order model. [ABSTRACT FROM AUTHOR]

In this paper, an efficient numerical algorithm is proposed for the valuation of unilateral American better-of options with two underlying assets. The pricing model can be described as a backward parabolic variational inequality with variable coefficients on a two-dimensional unbounded domain. It can be transformed into a one-dimensional bounded free boundary problem by some conventional transformations and the far-field truncation technique. With appropriate boundary conditions on the free boundary, a bounded linear complementary problem corresponding to the option pricing is established. Furthermore, the full discretization scheme is obtained by applying the backward Euler method and the finite element method in temporal and spatial directions, respectively. Based on the symmetric positive definite property of the discretized matrix, the value of the option and the free boundary are obtained simultaneously by the primal-dual active-set method. The error estimation is established by the variational theory. Numerical experiments are carried out to verify the efficiency of our method at the end. [ABSTRACT FROM AUTHOR]

Due to the fact that many classical numerical methods have not yet mature quantum counterparts, quantum circuit design is very important in quantum image processing. In this paper, using the novel enhanced quantum representation (NEQR) model, an image encryption algorithm based on Feistel structure is carried out in quantum computer by giving the encryption quantum circuits. First, the modified Feistel structure for image encryption is proposed. It is a 128-bit block cipher and requires 16-bit subkeys to encrypt the image, and it is a mixture of Feistel and substitution–permutation network; then, the detailed quantum circuits design of the encryption algorithm are given. Through numerical simulation and analysis, it is verified that the proposed quantum image encryption algorithm is effective and can resist statistical attacks effectively. [ABSTRACT FROM AUTHOR]

Tempered fractional Laplacian is the generator of the tempered isotropic Lévy process. This paper provides the finite difference discretization for the two-dimensional tempered fractional Laplacian by using the weighted trapezoidal rule and the bilinear interpolation. Then it is used to solve the tempered fractional Poisson equation with homogeneous Dirichlet boundary condition and the error estimate is also derived. Numerical experiments verify the predicted convergence rates and effectiveness of the schemes. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive generalised function projective synchronisation scheme of fractional-order chaotic systems with different dimensions and orders and fully unknown parameters is presented. On the basis of the Lyapunov method of fractional-order systems, a stability theorem of the fractional-order system with non-identical orders is proven. Using the fractional-order controller and adaptive control theory, sufficient conditions for synchronisation and unknown parameters update rules are obtained. Theoretical analysis and numerical simulations are provided to verify the validity of the proposed scheme. Moreover, synchronisation results are applied to secure communication via modified chaotic masking (MCM) method. The unpredictability of the scaling function matrix and the use of fractional-order systems with different orders can increase the security of the cryptosystem. The security analysis shows that the introduced algorithm has large key space, high sensitivity to encryption keys, higher security and the acceptable encryption speed. [ABSTRACT FROM AUTHOR]

In a minimum load spanning tree (MLST) problem, we are given an undirected graph and nondecreasing load functions for nodes defined on nodes' degrees in a spanning tree, and the objective is to find a spanning tree that minimizes the maximum load among all nodes. We propose the first O ∗ (2 n) time exact algorithm for the MLST problem, where n is the number of nodes and O ∗ ignores polynomial factor. The algorithm is obtained by repeatedly querying whether a candidate objective value is feasible, where each query can be formulated as a bounded degree spanning tree problem (BDST). We propose a novel solution to BDST by extending an inclusion-exclusion based algorithm. To further enhance the time efficiency of the previous algorithm, we then propose a faster algorithm by generalizing the concept of branching walks. In addition, for the purpose of comparison, we give the first mixed integer linear programming formulation for MLST. In numerical analysis, we consider various load functions on a randomly generated network. The results verify the effectiveness of the proposed algorithms. Summary of Contribution: Minimum load spanning tree (MLST) plays an important role in various applications such as wireless sensor networks (WSNs). In many applications of WSNs, we often need to collect data from all sensors to some specified sink. In this paper, we propose the first exact algorithms for the MLST problem. Besides having theoretical guarantees, our algorithms have extraordinarily good performance in practice. We believe that our results make significant contributions to the field of graph theory, internet of things, and WSNs. [ABSTRACT FROM AUTHOR]

The design of numerical approaches for the molecular beam epitaxy models has always been a hot issue in numerical analysis, in which one of the main challenges for algorithm design is how to establish a high-order time-accurate numerical method with unconditional energy stability. The numerical method developed in this paper is based on the "stabilized-Invariant Energy Quadratization" (S-IEQ) approach. Its novelty is that by adding a very simple linear stabilization term, the difficulty that the original energy potential for the no-slope selection case is not bounded from below can be easily overcome. Then by using the standard format of the IEQ method, we can easily obtain a linear, unconditionally energy stable, and second-order time accurate scheme for solving the system. We further implement various numerical examples to demonstrate the stability and accuracy of the proposed scheme. [ABSTRACT FROM AUTHOR]

To select reasonable PID controller parameters and improve control performances of hydraulic systems, a variable weight beetle antenna search algorithm is proposed for PID tuning in the hydraulic system. The beetle antennae search algorithm is inspired by the beetle preying habit depending on symmetry antennae on the head. The proposed algorithm added the exponential equation mechanism strategy in the basic algorithm to further improve the searching performance, the convergence speed, and the optimization accuracy and obtain new iteration and an updating method in the global searching and local searching stages. In the PID tuning process, advantages of less parameters and fast iteration are realized in the PID tuning process. In this paper, different dimension functions were tested, and results calculated by the proposed algorithm were compared with other famous algorithms, and the numerical analysis was carried out, including the iteration, the box-plot, and the searching path, which comprehensively showed the searching balance in the proposed algorithm. Finally, the reasonable PID controller parameters are found by using the proposed method, and the tuned PID controller is introduced into the hydraulic system for control, and the time-domain response characteristics and frequency response characteristics are given. The results show that the proposed PID tuning method has good PID parameter tuning ability, and the tuned PID has a good control ability, which makes the hydraulic system achieve the desired effect. [ABSTRACT FROM AUTHOR]

In this paper, we study, from the numerical point of view, a dynamic problem involving a mixture of two viscoelastic solids. The mechanical problem is written as a system of two coupled partial differential equations. Its variational formulation is derived and an existence and uniqueness result, and an energy decay property, are recalled. Then, fully discrete approximations are introduced by using the classical finite element method and the implicit Euler scheme. A discrete stability property and a priori error estimates are shown, from which we deduce the linear convergence of the algorithm. Finally, some numerical simulations, including examples in one and two dimensions, are presented to show the accuracy of the approximation and the behaviour of the solution. [ABSTRACT FROM AUTHOR]

Nonnegative matrix factorization, which decomposes a target matrix into the product of two matrices with nonnegative elements, has been widely used in various fields of science, engineering and technology. In this paper, we consider the more general Q-weighted nonnegative matrix factorization (QWNMF) problem. By using the additive representation of the Q-weighted norm, the QWNMF problem is transformed into an unconstraint optimization problem, and then a new iterative algorithm is designed to solve it. The numerical analysis of this algorithm is also given. Numerical examples show that the new method is feasible and effective. [ABSTRACT FROM AUTHOR]

Damping through friction tends to be one of the most efficient methods to suppress damage to structures from earthquakes. Realizing robust structures is therefore highly dependent on designing for the dynamic forces of friction- damped structures and exploring their reliability against natural disasters. This paper presents a simplified matrix analysis algorithm for multi-storey friction- damped buildings. We have analyzed the behavior of friction- damped systems more accurately by modeling the master-slave degree of freedom of the joints. First, the formulation of the problem is discussed, and a condensed general equation is derived. Then, an end- to- end solution is proposed to find the responses of structures. The displacement response of each storey has been carried out in both condensed and non-condensed general equations, and the results clearly show the accuracy of the proposed method. The numerical analysis and the results of the simulation of various friction- damped structures depicts the proposed approach consists with the commercial finite element method and is applicable for the analysis various types of structures. It is noted that the acceleration and displacement responses of the structures investigated under the proposed method and the traditional finite element method are so consistent that only a 1.5% difference is observed. Moreover, as a result of the proper allocation of degrees of freedom during the analysis, this method yields a reduction in computational costs especially in large buildings. [ABSTRACT FROM AUTHOR]

The finite-difference (FD) scheme is extensively applied in seismic modelling, imaging and inversion due to its advantages of large-scale parallel computing and programming. However, numerical dispersion caused by using a difference operator in substitution for the differential operator is non-negligible, which reduces the accuracy of the modelling and can lead to some misinterpretations. In addition, the computing resources required by the FD scheme is highly demanding when dealing with large models, which limits its applicability. In this paper, a new optimised FD scheme is proposed, which is based on an improved particle swarm optimisation (PSO) algorithm. We improve the conventional PSO algorithm by introducing strategies related to local learning and global learning, which contribute to accelerating the convergence rate and effectively avoiding getting trapped in local extrema. Then, the improved PSO algorithm is used to improve the conventional FD scheme. Dispersion analysis and numerical modelling demonstrate that the low-order optimised FD scheme can achieve higher accuracy than a high-order conventional operator. Compared with the conventional FD scheme and a FD scheme based on the Remez exchange algorithm, the optimised FD scheme based on the improved PSO algorithm can more efficiently suppress numerical dispersion and increase computational efficiency. [ABSTRACT FROM AUTHOR]

The delay time concept is widely adopted in literature to model the two‐stage failure process of most industrial systems which can be divided into normal stage (from new to an initial point of a defect) and defective stage (from defect arrival point to failure). Most existing delay time models assume that the normal and defective stages are independent. A generalized delay time model is proposed in this paper by considering the dependence between the normal and defective stages which is reflected in the fact that they share the same external shock process. According to the definition of shot‐noise process, external shocks will incur random hazard rate increments in the two stages. The failure state is self‐announcing, whereas the defective state can only be detected by block‐based inspection or opportunistic inspection offered by unexpected shutdown due to unavoidable external factors. The system is correctively replaced upon the occurrence of a system failure or preventively replaced at the detection of a defective state. Based on the stochastic failure model and maintenance policy, this paper evaluates system reliability performance and average long‐run cost rate via a Markov‐chain based approach. Finally, a case study on a steel convertor plant is given to demonstrate the applicability of the proposed model. [ABSTRACT FROM AUTHOR]

Frequency offset estimation is an important module in the synchronisation of underwater acoustic (UWA) orthogonal frequency division multiplexing (OFDM) systems. Different ways are used for carrier frequency offset (CFO) estimation such as maximum likelihood based on a cyclic prefix. In this paper, the Zadoff-Chu (ZC) sequences are used for OFDM synchronisation in underwater communications. The normalised carrier frequency offset can be estimated using the ZC cross-correlation between the primary synchronisation signal and the corresponding local signal, which causes large complexity. The ZC sequences have a time centre symmetric property, and thus the autocorrelation of the received primary synchronisation signal can be used for frequency offset estimation. In this paper, we propose a modified algorithm with low complexity for frequency offset estimation. Simulation results demonstrate that the proposed algorithm can estimate the frequency offset accurately with simple implementation in comparison with the traditional methods. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive nonlinear differential limiter (ANDL) is proposed to efficiently alleviate the impact of impulsive noise (IN) in a communication system. Unlike existing nonlinear methods, the ANDL is implemented in the analog domain where the broader acquisition bandwidth makes outliers more detectable and consequently it is easier to remove them. While the proposed ANDL behaves like a linear filter when there is no outlier, it exhibits intermittent nonlinearity in response to IN. Therefore, the structure of the matched filter in the receiver is modified to compensate the filtering effect of the ANDL in the linear regime. In this paper, we quantify the performance of the ANDL by deriving a closed-form analytical bound for the average signal-to-noise ratio at the output of the filter. The calculation is based on the idea that the ANDL can be perceived as a time-variant linear filter whose bandwidth is modified based on the intensity of the IN. In addition, by linearizing the filter time parameter variations, we treat the ANDL as a set of linear filters where the exact operating filter at a given time depends upon the magnitude of the outliers. The theoretical average bit error rate is validated through simulations and the performance gains relative to classical methods such as blanking and clipping are quantified. [ABSTRACT FROM AUTHOR]

In this paper, we propose a method for predicting the distributions of people's trajectories on the road network throughout a city. Specifically, we predict the number of people who will move from one area to another, their probable trajectories, and the corresponding likelihoods of those trajectories in the near future, such as within an hour. With this prediction, we will identify the hot road segments where potential traffic jams might occur and reveal the formation of those traffic jams. Accurate predictions of human trajectories at a city level in real time is challenging due to the uncertainty of people's spatial and temporal mobility patterns, the complexity of a city level's road network, and the scale of the data. To address these challenges, this paper proposes a method which includes several major components: (1) a model for predicting movements between neighboring areas, which combines both latent and explicit features that may influence the movements; (2) different methods to estimate corresponding flow trajectory distributions in the road network; (3) a MapReduce-based distributed algorithm to simulate large-scale trajectory distributions under real-time constraints. We conducted two case studies with taxi data collected from Beijing and New York City and systematically evaluated our method. [ABSTRACT FROM AUTHOR]

Generalized linear models (GLMs) are used in high-dimensional machine learning, statistics, communications, and signal processing. In this paper we analyze GLMs when the data matrix is random, as relevant in problems such as compressed sensing, error-correcting codes, or benchmark models in neural networks. We evaluate the mutual information (or "free entropy") from which we deduce the Bayes-optimal estimation and generalization errors. Our analysis applies to the high-dimensional limit where both the number of samples and the dimension are large and their ratio is fixed. Nonrigorous predictions for the optimal errors existed for special cases of GLMs, e.g., for the perceptron, in the field of statistical physics based on the socalled replica method. Our present paper rigorously establishes those decades-old conjectures and brings forward their algorithmic interpretation in terms of performance of the generalized approximate message-passing algorithm. Furthermore, we tightly characterize, for many learning problems, regions of parameters for which this algorithm achieves the optimal performance and locate the associated sharp phase transitions separating learnable and nonlearnable regions. We believe that this random version of GLMs can serve as a challenging benchmark for multipurpose algorithms. [ABSTRACT FROM AUTHOR]

Abstract A Boolean Finite Synchronous Dynamical System (BFDS, for short) consists of a finite number of objects that each maintains a boolean state, where after individually receiving state assignments, the objects update their state with respect to object-specific time-independent boolean functions synchronously in discrete time steps. The present paper studies the computational complexity of determining, given a boolean finite synchronous dynamical system, a configuration, which is a boolean vector representing the states of the objects, and a positive integer t , whether there exists another configuration from which the given configuration can be reached in t steps. It was previously shown that this problem, which we call the t -Predecessor Problem, is NP-complete even for t = 1 if the update function of an object is either the conjunction of arbitrary fan-in or the disjunction of arbitrary fan-in. This paper studies the computational complexity of the t -Predecessor Problem for a variety of sets of permissible update functions as well as for polynomially bounded t. It also studies the t -Garden-Of-Eden Problem, a variant of the t -Predecessor Problem that asks whether a configuration has a t -predecessor, which itself has no predecessor. The paper obtains complexity theoretical characterizations of all but one of these problems. [ABSTRACT FROM AUTHOR]

This paper studies the two-echelon capacitated vehicle routing problem with time windows. The first echelon consists of transferring freight from depots to intermediate facilities (i.e., satellites), whereas the second echelon consists of transferring freight from these facilities to the final customers, within their time windows. We propose two path-based mathematical formulations for our problem: (1) in one formulation, paths are defined over both first- and second-echelon tours, and (2) in the other one, the first- and second-echelon paths are decomposed. Branch-and-price–based algorithms are developed for both formulations. We compare both formulations and solution methods on a comprehensive set of instances and are able to solve instances up to five satellites and 100 customers to optimality. This paper is the first paper in the literature that solves such large instance sizes. The online appendix is available at https://doi.org/10.1287/trsc.2018.0844. [ABSTRACT FROM AUTHOR]

The paper addresses a sequential changepoint detection problem for a general stochastic model, assuming that the observed data may be non-i.i.d. (i.e., dependent and non-identically distributed) and prior distribution of the change point is arbitrary. Tartakovsky and Veeravalli (2005), Baron and Tartakovsky (2006), and, more recently, Tartakovsky (2017) developed a general asymptotic theory of changepoint detection for non-i.i.d. stochastic models, assuming certain stability of the log-likelihood ratio process, in the case of simple hypotheses when both pre-change and post-change models are completely specified. However, in most applications, the post-change distribution is not completely known. In the present paper, we generalize previous results to the case of parametric uncertainty, assuming that the parameter of the post-change distribution is unknown. We introduce two detection rules based on mixtures–the mixture Shiryaev rule and the mixture Shiryaev–Roberts rule–and study their asymptotic properties in the Bayesian context. In particular, we provide sufficient conditions under which these rules are first-order asymptotically optimal, minimizing moments of the delay to detection as the probability of false alarm approaches zero. [ABSTRACT FROM AUTHOR]

Avionics and air traffic management (ATM) systems are evolving with the introduction of progressively higher levels of automation, toward attaining the ambitious operational, technical, and safety enhancements required to sustain the present growth of global air traffic. This paper presents novel 4-Dimensional Trajectory (4DT) functionalities that are being developed for integration in ATM and avionics systems to support trajectory based operations (TBO). The 4DT planning process, which is the main focus of the paper, is supported by a custom multiobjective variant of state-of-the-art optimal control algorithms, incorporating various operational, economic, and environmental factors. Capitalizing on the higher theoretical accuracy offered by optimal control algorithms compared to other methods, a key feature of the proposed approach is the introduction of a postprocessing stage to ensure that the mathematically optimal trajectories are translated into a set of standardized 4DT descriptors, which can be flown by state-of-the-art automatic flight control systems. Additionally, to support air-ground 4DT intent negotiation and validation in the TBO context, the 4DT postprocessing ensures that optimal trajectories are synthetically described by a limited number of parameters, minimizing the bandwidth requirements imposed on airborne data links. Simulation-based verification activities addressing operational efficiency improvements and computational performance in the terminal area ATM context support the viability of the proposed 4DT planning functionality for online tactical TBO. [ABSTRACT FROM AUTHOR]

Highlights • The mathematical model of corrugated shells with special shapes is presented. • Effect of corrugation parameters on critical load is investigated. • Linear and nonlinear buckling analyses are conducted. • Critical load of corrugated shells is compared to smooth ones. • Specific range of corrugation parameters significantly increase the value of relative critical load. Abstract The problem of elastic stability of the shells with special shapes with corrugated middle surfaces under external pressure is debated in the presented paper. Solution of the problem is based on FEM study. Corrugated barrelled, pseudo-barrelled, and cylindrical shells of constant mass are considered. Geometrical modification of the middle surface geometry is based on sine wave along principal directions. Middle surface of the corrugated shells are described referring to differential geometry of surfaces by parametric functions in three-dimensional Euclidean space. Linear and nonlinear buckling analyses are conducted. Examples of buckling modes are presented, which differ significantly from those typical for shells of revolution with positive or zero Gaussian curvature. It is proven that corrugation may lead to serious increase or decrease of critical load for all types of presented shells. [ABSTRACT FROM AUTHOR]

Abstract This paper proposes a simplified reproducing kernel method to solve the linear Volterra integral equations with variable coefficients. The main idea of the method is to establish a reproducing kernel direct space that can be used in Volterra integral equations. And in the first time, this paper analyzes the convergence order and stability of the approximate solution. Then the uniform convergence of the numerical solution is proved, and the time consuming Schmidt orthogonalization process is avoided. The proposed method is proved to be stable and is not less than the second order convergence. The algorithm is proved to be feasible and stable through some numerical examples. [ABSTRACT FROM AUTHOR]

Purpose This paper aims to represent an improved whale optimization algorithm (WOA) based on a Lévy flight trajectory and called the LWOA algorithm to solve engineering optimization problems. The LWOA makes the WOA faster, more robust and significantly enhances the WOA. In the LWOA, the Lévy flight trajectory enhances the capability of jumping out of the local optima and is helpful for smoothly balancing exploration and exploitation of the WOA. It has been successfully applied to five standard engineering optimization problems. The simulation results of the classical engineering design problems and real application exhibit the superiority of the LWOA algorithm in solving challenging problems with constrained and unknown search spaces when compared to the basic WOA algorithm or other available solutions.Design/methodology/approach In this paper, an improved WOA based on a Lévy flight trajectory and called the LWOA algorithm is represented to solve engineering optimization problems.Findings It has been successfully applied to five standard engineering optimization problems. The simulation results of the classical engineering design problems and real application exhibit the superiority of the LWOA algorithm in solving challenging problems with constrained and unknown search spaces when compared to the basic WOA algorithm or other available solutions.Originality value An improved WOA based on a Lévy flight trajectory and called the LWOA algorithm is first proposed. [ABSTRACT FROM AUTHOR]

In order to provide a unified platform for fuzzy inference and fuzzy rule learning with noise-corrupted data, a method is proposed for reducing noise in learning data on the basis of a fuzzy inference method called α-GEMINAS (α-level-set and generalizedmean- based inference with fuzzy rule interpolation at an infinite number of activating points). It is expected to prevent fuzzy rules from overfitting to noise in learning data, especially when there is less learning data available for fuzzy rule optimization. The proposed method is named α-GEMI-ES (α-GEMINASbased local-evolution toward slight linearity for global smoothness) in this paper. α-GEMI-ES iteratively performs α-GEMINAS and reduces the noise in each iteration. This paper mathematically proves that α- GEMI-ES effectively reduces the noise. The noisereduction process is decisive and thus relies less on trial-and-error-based progress. The noise is reduced by a large amount in the early iterations and the amount of its reduction is decelerated in the later iterations where the deviation in the learning data is suppressed to a great extent. This property makes it easy to determine the termination conditions for the iterative process. Simulation results demonstrate that α-GEMI-ES properly reduces noise as the mathematical proof suggests. The above-mentioned properties indicate that α-GEMI-ES is feasible in practice for the unified platform. [ABSTRACT FROM AUTHOR]

• An algorithm of dexterity evaluation for continuum robots based on IK is proposed. • An IK model for continuum robots is established using an oval curve equation. • Length distribution of the robot is optimized based on dexterity indices. Performance evaluation and inverse kinematics (IK) for continuum robots are always hard and time-consuming. In this paper, an efficient dexterity evaluation algorithm based on IK (DEAIK) for continuum robots is proposed. The IK model is established using an oval curve equation to improve computational efficiency. The relationship between length distributions and dexterity distribution is obtained by the simulation in this paper. Length distribution of the two-segment continuum robot is optimized under the guidance of the dexterity indices using the fruit fly algorithm. Theoretical analysis and numerical simulations demonstrate that the dexterity of the structure-optimized continuum robot is better than that of the traditional continuum robot. The simulation shows that the DEAIK algorithm is 3.68 times faster than the algorithm based on forward kinematics. The IK algorithm in this paper is 3 203 times faster than the IK algorithm based on the Levenberg-Marquardt algorithm in the same accuracy. This work is significant for designing a high-performance continuum robot. [ABSTRACT FROM AUTHOR]