In recent decades, the Variational AutoEncoder (VAE) model has shown good potential and capabilities in image generation and dimensionality reduction. The combination of VAE and various machine learning frameworks has also worked effectively in different daily life applications, however its possibility and effectiveness in modern game design has seldom been explored nor assessed. The use of its feature extractor for data clustering was minimally discussed in literature neither. This paper first attempts to explore different mathematical properties of the VAE model, in particular, the theoretical framework of the encoding and decoding processes, the possible achievable lower bound and loss functions of different applications; then applies the established VAE model into generating new game levels within two well-known game settings; as well as validating the effectiveness of its data clustering mechanism with the aid of the Modified National Institute of Standards and Technology (MNIST) database. Respective statistical metrics and assessments were also utilized for evaluating the performance of the proposed VAE model in aforementioned case studies. Based on the statistical and spatial results, several potential drawbacks and future enhancement of the established model were outlined, with the aim of maximizing the strengths and advantages of VAE for future game design tasks and relevant industrial missions.

We present a Deep Learning generative model specialized to work with graphs with a regular geometry. It is build on a Variational Autoencoder framework and employs Graph convolutional layers in both encoding and decoding phases. We also introduce a pooling technique (ReNN-Pool), used in the encoder, that allows to downsample graph nodes in a spatially uniform and highly interpretable way. In the decoder, a symmetrical un-pooling technique is used to retrieve the original dimensionality of graphs. Performance of the model are tested on the standard Sprite benchmark dataset, a set of 2D images of video game characters, adequately transforming images data into graphs, and on the more realistic use-case of a dataset of cylindrical-shaped graph data that describe the distributions of the energy deposited by a particle beam in a medium.

We present a method to improve the reconstruction and generation performance of variational autoencoder (VAE) by injecting an adversarial learning. On the other hand, instead of comparing the reconstructed with the original data to calculate the reconstruction loss, we use a consistency principle for deep features. The training process of the VAE is then divided into two steps, training the encoder and then training the decoder. By using this two-step learning process, our method can be more widely used in applications other than image processing. While training the encoder, the label information is integrated to better structure the latent space in a supervised way. The adversarial constraints allow the decoder to generate data with better authenticity and more realistic than the conventional VAE. We present experimental results to show that our method gives better performance than the original VAE.

The rising number of unknown-type attacks on the Internet emphasizes the significance of developing efficient intrusion detection systems, even if machine learning-based techniques can detect unknown types of attacks. The necessity for innovative techniques is highlighted by the possibility that traditional machine learning techniques will not be sufficient for identifying these unknown types of attacks. In this research, we address this difficulty by proposing a deep learning-based solution: the log-cosh variational autoencoder (LVAE). When it comes to understanding intricate data distributions and creating freshly reconstructed data, LVAE inherits the strong modeling skills of the variational autoencoder (VAE). To better imitate discrete features of actual attacks and generate unknown types of attacks, this study develops an effective reconstruction loss term employing the logarithmic hyperbolic cosine (log-cosh) function in the log-cosh variational autoencoder (LVAE). When compared to conventional VAEs, LVAE exhibits promising potential for effectively generating data that closely resembles an unknown attack, a crucial capability for increasing the unknown attack detection rate. To categorize the generated unknown-type data, eight feature extraction and classification techniques were used. Using the most recent CICIDS2017 dataset, numerous experiments were carried out, training under varying amounts of real and unknown-type attacks. Our optimal experimental results outperformed several state-of-the-art techniques with accuracy and average F1 scores of 99.89% and 99.83%, respectively. Outstanding results were also shown by the suggested LVAE strategy for producing unknown attack data. In general, our work sets a strong basis for the accurate and efficient identification of unknown types of attacks and contributes to the development of intrusion detection techniques.

In this article, we introduce a new approach to human movement by defining the movement as a static object or a super object in one two-dimensional image. This method can allow researchers to label and describe the total movement as an object isolated from a reference video. This ap-proach allows us to perform various tasks, including finding similar movements in a video, measuring, and comparing movements, generating new similar movements, and defining chore-ography by controlling specific parameters in the human body skeleton. As a result of the pre-sented approach, we can eliminate the need to label images manually, disregard the problem of finding the beginning and the end of a movement, overcome synchronization issues between movements, and perform any deep learning network-based operation that processes super objects in images in general. As part of this article, we will demonstrate two application use cases: one il-lustrates how to verify and score a requested movement. In contrast, the other illustrates how to generate similar movements in the human skeleton space by addressing the challenge of supply-ing sufficient training data for deep learning applications (DL). A Variational Auto Encoder (VAE) simulator and an EfficientNet-B7 classifier architecture embedded within a Siamese twin neural network are presented in this paper in order to demonstrate two use cases. These use cases demonstrated the versatility of our innovative concept in measuring, categorizing, inferring hu-man behavior, and generating gestures for other researchers.

By combining stochastic variational inference with message passing algorithms we show how to solve the highly complex problem of navigation and avoidance in distributed multi-robot systems in a computationally tractable manner, allowing online implementation. Subsequently, the proposed variational method lends itself to more flexible solutions than prior methodologies. Furthermore, the derived method is verified both through simulations with multiple mobile robots and a real world experiment with two mobile robots. In both cases the robots shares the operating space and needs to cross each other’s paths multiple times without colliding.

In this work, the analytical treatment of Fourth order pd equations has been discussed with the variational iteration algorithm with an auxiliary parameter. The technique has the capability of reducing the size of computational work and easily overcomes the difficulty of the perturbation method or Adomian polynomials. Comparison with the classic variational iteration algorithm- is carried out, showing that the modification is more efficient and reliable.

The current paper is devoted to the introduction of simpler Eulerian variational principles from which all the relevant equations of non-barotropic stationary magnetohydrodynamics can be derived for magnetic fields which lie on surfaces. A variational principle is given in terms of three independent variables for stationary non-barotropic magnetohydrodynamic flows. This is a smaller number of variables than the eight variables which appear in the standard equations of non-barotropic magnetohydrodynamics which are the magnetic field, the velocity field, the specific entropy and the density. We further investigate the case in which the flow along magnetic lines is not ideal.

In this work, we try to find a way to describe the physical law of micro-world under the frame of a space-time theory. By introducing the scalar fields $\mathcal{D}\left( x\right)$ and $\zeta\left( x\right) $, we rewrite the action of conventional field theory and the Lagrangian describing the motion of the particle, where a modified space-time relation is obtained. To test the correctness of this attempt, we demonstrate the Klein-Gordon equation by the Hamilton-Jacobi method in four dimensional form and present a time delay for the ground state of hydrogen atom.

We prove a quasi-pseudometric version of the strong Ekeland principle proved by P. Georgiev and T. Suzuki.

One open question remains regarding the theory of the generalized variational principle, that is, why the stress-strain relation still be derived from the generalized variational principle while the Lagrangian multiplier method is applied in vain? This study shows that the generalized variational principle can only be understood and implemented correctly within the framework of thermodynamics. As long as the functional has one of the combination $A(\epsilon_{ij})-\sigma_{ij}\epsilon_{ij}$ or $B(\sigma_{ij})-\sigma_{ij}\epsilon_{ij}$, its corresponding variational principle will produce the stress-strain relation without the need to introduce extra constraints by the Lagrangian multiplier method. It is proved herein that the Hu-Washizu functional $\Pi_{HW}[u_i,\epsilon_{ij},\sigma_{ij}]$ and Hu-Washizu variational principle comprise a real three-field functional.

Impulsive noise is the main limiting factor for transmission over channels affected by electromagnetic interference. We study the estimation of (correlated) Gaussian signals in an impulsive noise scenarios. In this work, we analyze some of the existing as well as some novel estimation algorithms. Their performance is compared, for the first time, for different channel conditions, including the Markov-Middleton scenario, where the impulsive noise switches between different noise states. Following a modern approach in digital communications, the receiver design is based on a factor graph model and implements a message passing algorithm. The correlation among signal samples as well as among noise states brings about a loopy factor graph, where an iterative message passing scheme should be employed. As it is well known, approximate variational inference techniques are necessary in these cases. We propose and analyze different algorithms and provide a complete performance comparison among them, showing that both Expectation Propagation, Transparent Propagation, and the Parallel Iterative Schedule approaches reach a performance close to the optimal, at different channel conditions.

To address the instability of wind power caused by the randomness and intermittency of wind generation, as well as the challenges in power compensation by Hybrid Energy Storage Systems (HESS), this paper proposes a State of Charge (SOC) balancing control strategy based on Successive Variational Mode Decomposition and multi-fuzzy control. First, a consensus algorithm is used to enable communication between energy storage units to obtain the global average SOC. Then, the Secretary Bird Optimization Algorithm (SBOA) is applied to optimize the Successive Variational Mode Decomposition (SVMD) and Variational Mode Decomposition (VMD) for the initial allocation of wind power, resulting in the smoothing power for hybrid energy storage and the grid integration power. Finally, considering the deviation between the current SOC of the storage units and the global average SOC, dynamic partitioning is used for multi-fuzzy control to adjust the initial power allocation, achieving SOC balancing control. Simulations of the control strategy were conducted using Matlab/Simulink, and the results indicate that the proposed approach effectively smooths wind power fluctuations, achieving stable grid integration power. It enables the SOC of the HESS to quickly align with the global average SOC, preventing the HESS from entering unhealthy SOC regions.

This paper presents an approach to enhancing the clarity and intelligibility of speech in digital communications compromised by various background noises. Utilizing deep learning techniques, specifically a Variational Autoencoder (VAE) with 2D convolutional filters, we aim to suppress background noise in audio signals. Our method focuses on four simulated environmental noise scenarios: storms, wind, traffic, and aircraft. Training dataset has been obtained from public sources (TED-LIUM 3 dataset, which includes audio recordings from the popular TED-TALK series) combining with these background noises. The audio signals were transformed into 2D power spectrograms, upon which our VAE model was trained to filter out the noise and reconstruct clean audio. Our results demonstrate that the model outperforms existing state-of-the-art solutions in noise sup-pression. Although differences in noise types were observed, it was challenging to definitively conclude which background noise most adversely affects speech quality. Results have been assessed with objective methods (mathematical metrics) and subjective (listening to a set of audios by humans). Notably, wind noise showed the smallest deviation between the noisy and cleaned audio, perceived subjectively as the most improved scenario. Future work involves refining the phase calculation of the cleaned audio and creating a more balanced dataset to minimize differences in audio quality across scenarios. Additionally, practical ap-plications of the model in real-time streaming audio are envisaged. This research contributes significantly to the field of audio signal processing by offering a deep learning solution tailored to various noise conditions, enhancing digital communication quality.

We introduce a model of a passive optical cavity based on the two-dimensional Lugiato-Lefever equation, with a localized pump carrying intrinsic vorticity S, and the cubic or cubic-quintic nonlinearity. Up to S = 5, stable vortex-ring states (vortex pixels) are produced by a variational approximation and in a numerical form. Surprisingly, vast stability areas of the vortex states are found, for both the self-focusing and defocusing signs of the nonlinearity, in the plane of the pump-strength and loss parameters. When the vortex-rings are unstable, they are destroyed by azimuthal perturbations which break the axial symmetry. The results suggest new possibilities for mode manipulations in nonlinear optical media.

We study the back-reaction of fermion fields on the kink solution in one space and one time dimension. We employ a variational procedure to determine an upper limit for the minimum of the total energy. This energy has three contributions: the classical kink energy, the energy of valence fermions and the fermion vacuum polarization energy. The latter arises from the interaction of the kink with the Dirac sea and is required for consistency of the semi-classical expansion for the fermions. Earlier studies only considered the valence part and observed a substantial back-reaction. This was reflected by a sizable distortion of the kink profile. We find that this distortion is strongly mitigated when the Dirac sea is properly accounted for. As a result the back-reaction merely produces a slight squeeze or stretch of the kink profile.

In this study, we evaluate the nonlinear dynamics of convection flow using the thermodynamic variational principle, focusing on scenarios where multiple external forces, such as a thermal gradient and rotational field, are applied to a shallow annular pool. We observed that with the increase in the thermal gradient, the flow changed from an axial flow to a rotational oscillatory flow with the wave amplitudes aligned. Further increasing the temperature difference led to a rotational oscillatory flow characterized by alternating wave generation and annihilation. Our analysis of the flow, considering heat fluxes orthogonal to the thermal gradient, allowed us to describe the flow state as a phase at equilibrium. The state transition of the flow was accompanied by a discontinuous jump in the heat flux, which occurred at the intersection of the entropy production curves.

We overview the main equations of the Rayleigh-Ritz variational method and discuss their connection with the problem of simultaneous diagonalization of two Hermitian matrices.

Under suitable continuity and uniqueness conditions, solutions of an α order Caputo fractional boundary value problem are differentiated with respect to boundary values and boundary points. This extends well-known results for nth order boundary value problems. The approach used is a standard technique and makes heavy use of recent results for differentiation of solutions of Caputo fractional intial value problems with respect to initial conditions and continuous dependence for Caputo fractional boundary value problems.

In this paper, we consider a class of bilevel programming problems (abbreviated as, BLPP). Exploiting the generalized approximate convexity assumptions, we investigate the relations among the solutions of approximate Minty (respectively, Stampacchia) type variational inequalities (abbreviated as, AMTVI (respectively, ASTVI)), and the local ϵ-quasi solutions of the BLPP. Moreover, by employing the generalized Knaster–Kuratowski–Mazurkiewicz (abbreviated as, KKM)-Fan’s lemma, we derive some existence results for the solutions of approximate variational inequalities (abbreviated as, AVI), namely, AMTVI and ASTVI. A non-trivial example is given to highlight the importance of the established results. To the best of our knowledge, there is no research paper available in the literature that establishes relationships between the AVI and the BLPP under the assumptions of generalized approximate convexity in terms of limiting subdifferentials.

In this paper, we prove the existence of three solutions for a $p$-Kirchhoff problem with $\psi$-Hilfer fractional derivative. To be more precise, we use the variational method and we prove that the associated functional energy admits a critical point in each of the three constructed sets, these critical points are weak solutions for a studied problem. Moreover, by definition of these sets, one of these solutions is positive, the second is negative, and the third one change sign. At the end of this work, we present an example to validate our main results.

This paper discovers that current variational principle and Noether theorem for different physics systems with (in)finite freedom systems have missed the double extremum processes of the general extremum functional that both is deduced by variational principle and is necessarily taken in deducing all the physics laws, but these have not been corrected for over a century since Noether's proposing her famous theorem, which result in the crisis deducing relevant mathematical laws and all physics laws. This paper discovers there is the hidden logic cycle that one assumes Euler-Lagrange equations, and then he finally deduces Euler-Lagrange equations via the equivalent relation in the whole processes in all relevant current references. This paper corrects the current key mistakes that when physics systems choose the variational extreme values, the appearing processes of the physics systems are real physics processes, otherwise, are virtual processes in all current articles, reviews and (text)books. The real physics should be after choosing the variational extreme values of physics systems, the general extremum functional of the physics systems needs to further choose the minimum absolute extremum zero of the general extremum functional, otherwise, the appearing processes of physics systems are still virtual processes. Using the double extremum processes of the general extremum functionals, the crisis and the hidden logic cycle in current variational principle and current Noether theorem are solved. Furthermore, the new mathematical and physical double extremum processes and their new mathematical pictures and physics for (in)finite freedom systems are discovered. This paper gives both general variational principle and general Noether theorem as well as their classical and quantum new physics, which would rewrite all relevant current different branches of science, as key tools of studying and processing them.

The vibration signal of heavy gearbox presents non-stationary and nonlinear characteristics, which increases the difficulty to extract the fault feature. When the gear has a subtle fault, it may cause a perceptible change of local fluctuation rather than the large scale fluctuation. Therefore, the feature parameters extracted from local fluctuation can effectively improve the recognition performance of the gear fault. In this paper, a novel signal processing method based on variational mode decomposition (VMD) and detrended fluctuation analysis (DFA) is proposed to identify the gear fault of heavy gearbox. Firstly, the raw vibration signal is decomposed several mode components by VMD, which is an adaptive and non-recursive signal decomposition method. Next, the sensitive mode component is selected by a maximal indicator, which is composed of kurtosis and correlation coefficient of relative higher frequency mode components corresponding to local fluctuation of raw vibration signal. Finally, the characteristics of the double-scales feature parameters of selected sensitive mode are extracted by DFA. In addition, the position of turning point of double scales is estimated by sliding windowing algorithm. The proposed method is evaluated through its application to gear fault classification using vibration signal. The results demonstrates that the recognization rate of gear faults condition have marked improvement by proposed method than the DFA of Small Time Scale (STS-DFA) method.

In this paper, we introduce a new causal formula to distinguish Gliosarcoma (GSM) from Glioblastoma (GBM). Our formula combines Probabilistic Easy Variational Causal Effect (PEACE) with XGBoost, or eXtreme Gradient Boosting algorithm. Unlike prior research, which often relied on statistical models to reduce dataset dimensions before causal analysis, our approach uses the complete dataset with PEACE and XGBoost algorithm. PEACE provides a comprehensive measurement of direct causal effects, applicable to both continuous and discrete variables. It offers a spectrum of both positive and negative causal effects of the events causal effect values based on the degree ?, reflecting the rarity and frequency of the events. By using PEACE with XGBoost, we achieve a detailed and nuanced understanding of the causal relationships within the dataset features, facilitating accurate differentiation between GSM and GBM.

Generative artificial intelligence (GenAI) has been developing with many incredible achievements like ChatGPT and Bard. Deep generative model (DGM) is a branch of GenAI, which is preeminent in generating raster data such as image and sound due to strong points of deep neural network (DNN) in inference and recognition. The built-in inference mechanism of DNN, which simulates and aims to synaptic plasticity of human neuron network, fosters generation ability of DGM which produces surprised results with support of statistical flexibility. Two popular approaches in DGM are Variational Autoencoders (VAE) and Generative Adversarial Network (GAN). Both VAE and GAN have their own strong points although they share and imply underline theory of statistics as well as incredible complex via hidden layers of DNN when DNN becomes effective encoding/decoding functions without concrete specifications. In this research, VAE and GAN is unified into a consistent and consolidated model called Adversarial Variational Autoencoders (AVA) in which VAE and GAN complement each other, for instance, VAE is good at generator by encoding data via excellent ideology of Kullback-Leibler divergence and GAN is a significantly important method to assess reliability of data which is realistic or fake. In other words, AVA aims to improve accuracy of generative models, besides AVA extends function of simple generative models. In methodology this research focuses on combination of applied mathematical concepts and skillful techniques of computer programming in order to implement and solve complicated problems as simply as possible.

Quantum computing (QC) has opened the door to advancements in machine learning (ML) tasks that are currently implemented in the classical domain. Convolutional neural networks (CNNs) are classical ML architectures that exploit data locality and possess a simpler structure than fully-connected multi-layer perceptrons (MLPs) without compromising the accuracy of classification. However, the concept of preserving data locality is usually overlooked in the existing quantum counterparts of CNNs, particularly for extracting multi-features in multidimensional data. In this paper, we present a multidimensional quantum convolutional classifier (MQCC) that performs multidimensional and multi-feature quantum convolution with average and Euclidean pooling and thus adapting the CNN structure to a variational quantum algorithm (VQA). Average pooling is based on the quantum Haar transform (QHT) and Euclidean pooling is based on partial quantum measurement. The experimental work was conducted using multidimensional data to validate the correctness and demonstrate the scalability of the proposed method utilizing both noisy and noise-free quantum simulations. We evaluated the MQCC model with reference to reported work on state-of-the-art quantum simulators from IBM Quantum and Xanadu using a variety of standard ML datasets. The experimental results showed favorable characteristics of our proposed techniques compared to existing work with respect to a number of quantitative metrics such as the number of training parameters, cross-entropy loss, classification accuracy, circuit depth, and quantum gate count.

As a fast and nondestructive spectroscopic analysis technique, Raman spectroscopy has been widely applied in chemistry. However, noise is usually unavoidable in Raman spectra. Hence, denoising is an important step before Raman spectral analysis. A novel spectral denoising method based on variational mode decomposition (VMD) was introduced to solve the above problem. The spectrum is decomposed into a series of modes (uk) by VMD. Then, the high frequency noise modes are removed and the remaining modes are reconstructed to obtain the denoised spectrum. The proposed method was verified by two artificial noised signals and two actual Raman spectra. As comparison, empirical mode decomposition (EMD), Savitzky-Golay (SG) smoothing and discrete wavelet transformation (DWT) are also investigated. At the same time, signal-to-noise ratio (SNR) was introduced as evaluation indicators to verify the performance of the proposed method. The results show that compared with EMD, VMD can significantly improve mode mixing and endpoint effect. Some information of the small sharp peak is lost after VMD denoising. However, VMD lost fewer information than that of EMD, SG smoothing and DWT. Moreover, the Raman spectrum by VMD denoising is more excellent than that of EMD, SG smoothing and DWT in terms of visualization and SNR. Therefore, VMD provides superior denoising capabilities for Raman spectra.

Deep learning is improving by leaps and bounds in remote sensing images (RSIs) analysis, pre-trained convolutional neural networks (CNNs) have shown remarkable performance in remote sensing image scene classification (RSISC). Nonetheless, pre-trained CNNs require massive annotated data as samples for data training. When labeled samples are not sufficient, the most common solution is to the pre-trained CNNs using a great deal of natural image dataset (e.g. ImageNet). However, these pre-trained CNNs require a large quantity of labelled data for training, which is often not feasible in RSISC, especially when the target RSIs have different imaging mechanisms from RGB natural images. In this paper, we proposed an improved hybrid classical-quantum transfer learning CNNs composed of classical and quantum elements to classify open-source RSI dataset. The classical part of the model is made up of a ResNet network which extracts useful features from RSI datasets. To further refine the network performance, a tensor quantum circuit is subsequently employed by tuning parameters on near-term quantum processors. We tested our models on open-source RSI dataset. In our comparative study, we have concluded that the hybrid classical-quantum transferring CNN has achieved better performance than other pre-trained CNNs based RSISC methods with small training samples. Moreover, it has been proved that the proposed algorithm improves the classification accuracy while greatly decreasing sum of model parameters and sum of training data.

Quantile regression model is widely used in variable relationship research of general size data, due to strong robustness and more comprehensive description of the response variables' characteristics. With the increase of data size and data dimension, there have been some studies on high-dimensional quantile regression under the classical statistical framework, including higher-efficient frequency perspective, which is however at cost of randomness quantification, or lower-efficient Bayesian method based on MCMC sampling. To overcome these problems, we propose the high-dimensional quantile regression with Spike-and-Slab Lasso penalty based on variational Bayesian (VBSSLQR), which can not only improve the computational efficiency but also measure the randomness via variational distributions. The simulation studies and real data analysis illustrate that the proposed VBSSLQR method is superior to or equivalent to other quantile and non-quantile regression methods (including Bayesian and non-Bayesian methods), and its efficiency is higher than any other method.

Gradient-domain image processing is a technique where, instead of operating directly on the image pixel values, the gradient of the image is computed and processed. The resulting image is obtained by reintegrating the processed gradient. This is normally done by solving the Poisson equation, most oftenly by means of a finite difference implementation of the gradient descent method. However, this technique in some cases lead to severe haloing artefacts in the resulting image. To deal with this, local or anisotropic diffusion has been added as an ad-hoc modification of the Poisson equation. In this paper, we show that a version of anisotropic gradient-domain image processing can result from a more general variational formulation through the minimisation of a functional formulated in terms of the eigenvalues of the structure tensor of the differences between the processed gradient and the gradient of the original image. Example applications of linear and non-linear local contrast enhancement and colour image daltonisation illustrate the behaviour of the method.

Diesel engines, as power equipment, are widely used in the fields of automobile industry, ship and power equipment. Due to wear or faulty adjustment, the valve train clearance abnormal fault is a typical failure of diesel engines, which may result in the performance degradation, even valve fracture and cylinder hit fault. However, the failure mechanism features mainly in time domain and angular domain, on which the current diagnosis methods based, are easily affected by working conditions or hard to extract accurate enough, as the diesel engine keeps running in transient and non-stationary process. This work arms at diagnosing this fault mainly based on frequency band features which would change when the valve clearance fault occurs. For the purpose of extracting a series of frequency band features adaptively，a decomposition technique based on improved variational mode decomposition is investigated in this work. As the connection between the features and the fault is fuzzy, the random forest algorithm is used to analyze the correspondence between features and faults. In addition, the feature dimension is reduced to improve the operation efficiency according to importance score. The experimental results under variable speed condition show that the method based on variational mode decomposition and random forest is capable to detect valve clearance fault effectively.

In this paper, we introduce some basic idea of Variational iteration method for short (VIM) to solve the Volterra’s integro-differential equations. The VIM is used to solve effectively, easily, and accurately a large class of non-linear problems with approximations which converge rapidly to accurate solutions. For linear problems, it’s exact solution can be obtained by only one iteration step due to the fact that the Lagrange multiplier can be exactly identified. It is to be noted that the Lagrange multiplier reduces the iteration on integral operator and also minimizes the computational time. The method requires no transformation or linearization of any forms. Two numerical examples are presented to show the effectiveness and efficiency of the method. Also, we compare the result with the result from Homotopy perturbation method (HPM). Finally, we investigate the absolute difference between variational iteration method and homotopy perturbation method and draw the graph of difference function by using Mathematica.

The vibration signal of the engine contains strong background noise and many kinds of modulating components, which is difficult to diagnose. Variational mode decomposition (VMD) is a recently introduced adaptive signal decomposition algorithm with a solid theoretical foundation and good noise robustness compared with empirical mode decomposition (EMD). VMD can effectively avoid endpoint effect and modal aliasing. However, VMD cannot effectively eliminate the random noise in the signal, so the random decrement technique is introduced to solve the problem. Based on the crankshaft bearing fault simulation experiment, the four kinds of wear state vibration signals are decomposed by VMD, and the modal components with smaller permutation entropy are selected as fault components. Then the fault component is processed by the random decrement technique, and the Hilbert envelope spectrum of the fault component is obtained. Compared with the fault feature extraction method based on EMD and EEMD, the feature extraction results of the proposed method are better than those of the above two methods. The simulation analysis and the simulation test of the crankshaft bearing fault verify the effectiveness of the proposed method.

Variational mode decomposition (VMD) is a recently introduced adaptive signal decomposition algorithm with a solid theoretical foundation and good noise robustness compared with empirical mode decomposition (EMD). There is a lot of background noise in the vibration signal of diesel engine. To solve the problem, a denoising algorithm based on VMD and Euclidean Distance is proposed. Firstly, a multi-component, non-Gauss, and noisy simulation signal is established, and decomposed into a given number K of band-limited intrinsic mode functions by VMD. Then the Euclidean distance between the probability density function of each mode and that of the simulation signal are calculated. The signal is reconstructed using the relevant modes, which are selected on the basis of noticeable similarities between the probability density function of the simulation signal and that of each mode. Finally, the vibration signals of diesel engine connecting rod bearing faults are analyzed by the proposed method. The results show that compared with other denoising algorithms, the proposed method has better denoising effect, and the fault characteristics of vibration signals of diesel engine connecting rod bearings can be effectively enhanced.

To address the issue of intelligent optimization algorithms being prone to local optima, resulting in insufficient feature extraction and low fault type recognition rates when optimizing Variational Mode Decomposition (VMD) and Support Vector Machine (SVM) parameters, this paper proposes a fault diagnosis method based on an improved Artificial Gorilla Troops Optimization (GTO) algorithm. The GTO algorithm is enhanced using Logistic chaotic mapping, a linear decreasing weight factor, the global exploration strategy of the Osprey Optimization Algorithm, and the Levy flight strategy, improving its ability to escape local optima, adaptability, and convergence accuracy. This algorithm is used to optimize the parameters of VMD and SVM for fault diagnosis. Experiments on fault diagnosis with two datasets of different sample sizes show that the proposed method achieves a diagnostic accuracy of no less than 98% for samples of varying sizes, with stable and reliable results.

This study investigates anomaly detection of IoT device traffic using Convolutional Neural Networks (CNN) and Variational Autoencoders (VAE) to enhance the detection capability of security threats in IoT environments. A series of hardware configurations, software environments, and hyperparameters were utilized to optimize the training and testing processes of the models. The CNN model demonstrates robust classification performance, achieving an accuracy rate of 95.85% on the test dataset, effectively distinguishing between different types of IoT device traffic. Meanwhile, the VAE model exhibits proficient anomaly detection capabilities by effectively capturing abnormal patterns in the data using reconstruction loss and KL divergence. The combined use of CNN and VAE models offers a comprehensive solution to cybersecurity challenges in IoT environments. Future research directions include exploring diverse IoT traffic data, practical deployment for validation, and further optimization of model structures and parameters to improve performance and applicability.

In this paper, we propose a system of nonlinear mixed variational inequality problems, which consists of two elliptic mixed variational inequality problems on Banach spaces. Under suitable assumptions, using the Kakutani-Ky Fan fixed point theorem and Minty techniques, we prove the solution set to the system of nonlinear mixed variational inequality problem is nonempty, weakly compact and unique. Additionally, we suggest a stability result for the system of nonlinear mixed variational inequality problem by perturbing the duality mappings. Furthermore, we present an optimal control problem governed by the system of nonlinear mixed variational inequality problems and establish a solvability result.

In this paper, impulsive control on a single-species Markovian jumping ecosystem leads to a stability criterion, and the newly-obtained theorems improve the related existing results. Numerical examples illuminate the effectiveness.

The power converter is the significant device in a wind power system. Wind turbine will be shut down and off grid immediately with the occurrence of the IGBT module open-circuit fault of power converter, which will seriously impact the stability of grid and even threaten personal safety. However, in the existing diagnosis strategies of power converter, there are few single and double IGBT modules open-circuit fault diagnosis methods producing negative results including erroneous judgment, omissive judgment and low accuracy. In this paper, a novel method to diagnose the single and double IGBT modules open-circuit faults of the permanent magnet synchronous generator (PMSG) wind turbine grid-side converter (GSC) is proposed. Above all, collecting the three-phase current varying with wind speed of 22 failure states including a normal state of PMSG wind turbine GSC as the original signal data. Afterward, the original signal data are decomposed by using variational mode decomposition (VMD) to obtain the mode coefficient series, which are analyzed by the proposed method base on fault trend feature for extracting the trend feature vectors. Finally, the trend feature vectors are used as the input of deep belief network (DBN) for decision-making and obtaining the classification results. The simulation and experimental results show that the proposed method can diagnose the single and double IGBT modules open-circuit faults of GSC, and the accuracy is higher than the benchmark models.

Structural health monitoring (SHM) has become paramount for developing cheaper and more reliable maintenance policies. The advantages coming from adopting such process have turned out to be particularly evident when dealing with plated structures. In this context, state-of-the-art methods are based on exciting and acquiring ultrasonic guided waves through a permanently installed sensor network. A baseline is registered when the structure is healthy, and newly acquired signals are compared to it to detect, localize and quantify damage. To this purpose, the performance of traditional methods based on tomographic algorithms has been overcome by machine learning approaches, which allow processing a larger amount of data without losing diagnostic information. However, to date, no diagnostic method can deal with varying environmental and operational conditions. This works aims to develop a framework for mitigating the impact of temperature variations on ultrasonic guided wave-based SHM through generative artificial intelligence. A variational autoencoder and singular value decomposition were combined to learn the influence of temperature on guided waves. After training, the generative part of the algorithm was used to reconstruct signals at new unseen temperatures. Moreover, a refined version of the algorithm called forced variational autoencoder was introduced to further improve the reconstruction capabilities. The accuracy of the proposed framework was demonstrated against real measurements on a composite plate.

The potential of quantum computing for scientific and industrial breakthroughs is immense, however, we are still in the Noisy Intermediate-Scale Quantum (NISQ) era, where the currently available quantum devices contain small numbers of qubits, are very sensitive to environmental conditions and prone to quantum decoherence. Even so, existing NISQ computers have already been shown to outperform conventional computers on specific problems and the key question is how to make use of today’s NISQ devices to achieve quantum advantage in the field of computational science and engineering (CSE). In this direction, this work proposes a hybrid computing formulation by combining quantum computing with machine learning for accelerating the solution of parameterized linear systems in NISQ devices. In particular, it focuses on the Variational Quantum Linear Solver (VQLS), which is a hybrid quantum- classical algorithm for solving linear systems of equations. VQLS employs a short-depth quantum circuit to efficiently evaluate a cost function related to the system solution. The algorithm’s circuit consists of a quantum gate sequence (unitary operators) that involves a set of tunable parameters. Then, well-established classical optimizers are utilized to tune the parameters of the sequence in order to minimize the cost function, which is equivalent to finding the system solution at an acceptable level of accuracy. In this work, it is demonstrated that machine learning tools such as feed-forward neural networks and nearest-neighbor interpolation techniques can be successfully employed to accelerate the convergence of the VQLS algorithm towards the optimal values for the circuit parameters when applied to parameterized linear systems that need to be solved for multiple parameter instances.

In many Bayesian computations, first, we obtain the expression of the joint distribution of all the unknown variables given the observed data. In general, this expression is not separable in those variables. Thus, obtaining their marginals for each variable and computing the expectations are difficult and costly. This problem becomes even more difficult in high dimensional quandaries, which is an important issue in inverse problems. We may then try to propose a surrogate expression with which we can do approximate computations. Often a separable expression approximation can be useful enough. The Variational Bayesian Approximation (VBA) is a technique that approximates the joint distribution $p$ with an easier, for example separable, one $q$ by minimizing Kullback–Leibler Divergence $KL(q|p)$. When $q$ is separable in all the variables, the approximation is also called Mean Field Approximation (MFA) and so $q$ is the product of the approximated marginals. A first standard and general algorithm is alternate optimization of $KL(q|p)$ with respect to $q_i$. A second general approach is its optimization in the Riemannian manifold. However, in this paper, for practical reasons, we consider the case where $p$ is in the exponential family and so is $q$. For this case, $KL(q|p)$ becomes a function of the parameters $\thetab$ of the exponential family. Then, we can use any other optimization algorithm to obtain those parameters. In this paper, we compare three optimization algorithms: standard alternate optimization, a gradient-based algorithm and a natural gradient algorithm and study their relative performances on three examples.

In this paper a new monolithic Eulerian formulation in the framework of non-classical continuum is presented for the analysis of fluid-strucutre interaction problems. In this respect, Cosserat continuum theory taking into account the micro-rotational degrees of freedom of the particles is considered. Continuum description of the model and variational formulation of the governing flow dynamics for non-classical -fluid-structure interaction nCFSI is presented. The model is analyzed by computing a well known benchmark problem by Hecht and Pironneau [16]. The algorithmic description is presented and implemented using FreeFEM++. Code is validated with the benchmark solution of Turek and Hron [38] in case of flow around a flag attached with cylinder. New microstructral behavior of the solution is studied and numerical simulations and results are shown in the form of figures. Some interesting feature of the flow is observed and microstructural characteristics are discussed.

In this article, we present a comparative study between the Adomian Decomposition Method (ADM) and Variational Iteration Method (VIM). The study outlines the significant features of the two methods, for solving nonlinear Volterra-Fredholm integro-differential equations. From the computational viewpoint, the VIM is more efficient, convenient and easy to use. Moreover, we proved the existence and uniqueness results and convergence of the solution. Finally, an example is included to demonstrate the validity and applicability of the proposed techniques.

In this paper, we focus on variational Bayesian learning deterministic optimization methods for inference in biparametric exponential models where the parameters follow semiparametric regression structures. This combination of data models and algorithms contributes to solving real-world problems and reduces the computation time. This allows both the rapid exploration of many data models and the accurate estimation of the mean and variance functions through the connection between generalized linear models and graph theory. A simulation study was carried out to assess the performance of the deterministic approximation. Finally, herein, we present an application using macroeconomic data to emphasize the benefits of the proposed approach.

Firstly, the author do dynamic analysis for reaction-diffusion Gilpin-Ayala competition model with Dirichlet boundary value, involved in harmful species. Existence of multiple stationary solutions is verified by way of Mountain Pass lemma, and the local stability result of the null solution is obtained by employing linear approximation principle. Secondly, the author utilize variational methods and LMI technique to deduce the LMI-based global exponential stability criterion on the null solution which becomes the unique stationary solution of the ecosystem with delayed feedback under a reasonable boundedness assumption on population densities. Particularly, LMI criterion is involved in free weight coefficient matrix, which reduces the conservatism of the algorithm. In addition, a new impulse control stabilization criterion is also derived. Finally, two numerical examples show the effectiveness of the proposed methods. It is worth mentioning that the obtained stability criteria of null solution presented some useful hints on how to eliminate pests and bacteria.

Airborne distributed position and orientation system (ADPOS), which integrates multi-inertia measurement units(IMUs), data-processing computer and Global Navigation Satellite System (GNSS), serves as a key sensor in new higher-resolution airborne remote sensing, such as array SAR, multinode imaging loads and so on. ADPOS can provide multinode high accuracy spatio-temporal reference information to realize multinode motion compensation with the various state estimation methods such as Central Difference Kalman Filtering (CDKF), modifed CDKF. However, these methods focus on noise optimization based on known nonlinear models and its linear minimum variance estimation criterion, which cannot gain better estimation performance for high-dimensional nonlinear systems. For this reason, the variational optimization process based on conjugate gradient algorithm is proposed for the estimation of filtering update step, which is more efficient than linear minimum variance estimation criterion. Therefore, aiming at ADPOS with high-dimensional and nonlinearity, Central Difference Variational Filtering (CDVF) using variational optimization based on conjugate gradient algorithm for mean correction in the filtering update stage is devoted to advancing the estimation accuracy of multinode motion parameters. A real ADPOS flight test has been conducted, the experimental results show that the accuracy of the slave motion parameters has a distinct progress than the up to date CDKF, and the compensation performance is distinct.

Uncertainty relations in hydrodynamics are numerically studied. We first give a review for the formulation of the generalized uncertainty relations in the stochastic variational method (SVM), following the work by two of the present authors [Phys.\ Lett.\ A\textbf{382}, 1472 (2018)]. In this approach, the origin of the finite minimum value of uncertainty is attributed to the non-differentiable (virtual) trajectory of a quantum particle and then both of the Kennard and Robertson-Schr\"{o}dinger inequalities in quantum mechanics are reproduced. The same non-differentiable trajectory is applied to the motion of fluid elements in the Navier-Stokes-Fourier equation or the Navier-Stokes-Korteweg equation. By introducing the standard deviations of position and momentum for fluid elements, the uncertainty relations in hydrodynamics are derived. These are applicable even to the Gross-Pitaevskii equation and then the field-theoretical uncertainty relation is reproduced. We further investigate numerically the derived relations and find that the behaviors of the uncertainty relations for liquid and gas are qualitatively different. This suggests that the uncertainty relations in hydrodynamics are used as a criterion to classify liquid and gas in fluid.

In this paper, we proposed the numerical method called the variational iteration orthogonal collocation method (VIOCM), for the approximate solution of the deadly Corona virus model using Mamadu-Njoseh polynomials as basis functions. The proposed method is an elegant mixture of the variational iteration method (VIM) and the orthogonal collocation method (OCM). It was observed that the proposed method converges rapidly to the exact solution even as N increases. This suggests that the use of orthogonal polynomials as trial functions for the SEIR model is indeed an effective approximant as it produces the analytic solution at just few iterations. Resulting numerical evidences were compared with the standard variational iteration method as available in literature. All computational frameworks were executed with MAPLE software.

This work has its origin in intuitive physical and statistical considerations. The problem of optimizing an artificial neural network is treated as a physical system, composed of a conservative vector force field. The derived scalar potential is a measure of the potential energy of the network, a function of the distance between predictions and targets. Starting from some analogies with wave mechanics, the description of the sys-tem is justified with an eigenvalue equation that is a variant of the Schr˜odinger equation, in which the potential is defined by the mutual information between inputs and targets. The weights and parameters of the network, as well as those of the state function, are varied so as to minimize energy, using an equivalent of the variational theorem of wave mechanics. The minimum energy thus obtained implies the principle of minimum mutual information (MinMI). We also propose a definition of the potential work produced by the force field to bring a network from an arbitrary probability distribution to the potential-constrained system, which allows to establish a measure of the complexity of the system. At the end of the discussion we expose a recursive procedure that allows to refine the state function and bypass some initial assumptions, as well as a discussion of some topics in quantum mechanics applied to the formalism, such as the uncertainty principle and the temporal evolution of the system. Results demonstrate how the minimization of energy effectively leads to a decrease in the average error between network predictions and targets.

Deflectometry is a key component in the precise measurement of specular (mirrored) surfaces, however traditional methods often lack an end-to-end approach that performs 3D reconstruction in a single shot with high accuracy and generalizes across different free-form surfaces. This paper introduces a novel deep neural network (DNN)-based approach for end-to-end 3D reconstruction of free-form specular surfaces using single-shot deflectometry. Our proposed network, VUDNet, innovatively combines discriminative and generative components to accurately interpret orthogonal fringe patterns and generate high-fidelity 3D surface reconstructions. By leveraging a hybrid architecture integrating a Variational Autoencoder (VAE) and a modified U-Net, VUDNet excels in both depth estimation and detail refinement, achieving superior performance in challenging environments. Extensive data simulation using Blender, leading to a dataset which we are making available, ensures robust training and enables the network to generalize across diverse scenarios. Experimental results demonstrate the strong performance of VUDNet, setting a new standard for 3D surface reconstruction. The implementation of VUDNet is available on GitHub at https://github.com/hadious/VUDNet.

We study Hadamard's variational formula for simple eigenvalues under dynamical and conformal deformations. Particularly, harmonic convexity of the first eigenvalue of the Laplacian under the mixed boundary condition is established for two-dimensional domain, which implies several new inequalities.

Emerging semiconductor devices often lack accurate analytical models. The same is usually true of any devices working under extreme conditions like cryogenic temperatures. The usual workaround involves the use of approximation models, usually based on lookup tables or neural networks individually fitted to measurement data. In the case of experimental devices or ones working under extreme conditions, the number of units available for measurement is limited. As a result, the number of approximation-model instances is too small to enable a statistical simulation of even middle-sized circuits, which is a necessary step in integrated-circuit design since it provides the realistic picture of the circuit’s behavior in the presence of manufacturing process variations. Approximation models using structure parameters as inputs do exist in the literature, but are only useful if the end user knows the statistical distributions of those parameters, which is not usually the case. We propose a technique based on generative machine learning, namely the variational autoencoder, that uses only a small sample of devices to capture the essential features of their I–V curves under process variations and subsequently generates an arbitrary number of similarly disturbed curves. The model trained on as few as 20 instances per device type is shown to precisely reproduce the distributions of period and power consumption of a ring oscillator.

This article develops a duality principle and a related convex dual formulation suitable for a large class of models in physics and engineering. The results are based on standard tools of functional analysis, calculus of variations and duality theory. In particular, we develop applications to a model in non-linear elasticity.

This article develops duality principles and related convex dual formulations suitable for the local optimization of non-convex primal formulations for a large class of models in physics and engineering. The results are based on standard tools of functional analysis, calculus of variations and duality theory. In particular, we develop applications to a Ginzburg-Landau type equation.

Bayesian techniques for engineering problems, that rely on Gaussian process (GP) regression, are known for their ability to quantify epistemic and aleatory uncertainties and for being data efficient. The mathematical elegance of applying these methods usually comes at a high computational cost when compared to deterministic and empirical Bayesian methods. Furthermore, using these methods becomes practically infeasible in scenarios characterized by a large number of inputs and thousands of training data. The focus of this work is on enhancing Gaussian Process-based metamodeling and model calibration tasks, when the size of the training datasets is significantly large. To achieve this goal, we employ a stochastic variational inference algorithm that enables rapid statistical learning of the calibration parameters and hyperparameter tuning, while retaining the rigor of Bayesian inference. The numerical performance of the algorithm is demonstrated on multiple metamodeling and model calibration problems with thousands of training data.

In this paper, our goal is to establish the relationship between solutions of local sharp vector variational type inequality and sharp efficient solutions of vector optimization problems, also Minty local sharp vector variational type inequality and sharp efficient solutions of vector optimization problems, under generalized approximate $\eta$-convexity conditions for locally Lipschitzian functions

The present paper discusses an elliptic equation with Steklov boundary conditions and $(p(x),q(x))$-Laplacian. Using mountain pass theorem together with Ekeland's variational principle, we prove, under appropriate conditions on the functions involved, that the problem admits at least two solutions.

The design of thin-walled structures is commonly based on the solutions of linear boundary-valued problems, formulated within well-developed theories for elastic plates and shells. However, in modern appliances, especially in MEMS design, it is necessary to take into account non-linear mechanical effects that become decisive for flexible elements. Among substantial non-linear effects, that significantly change the deformation properties of thin plates, are the effects of residual stresses caused by incompatibility of deformations, which inevitably arise during the manufacture of ultra-thin elements. The development of new methods of mathematical modeling of residual stresses and incompatible finite deformations in plates is the subject of the paper. To this end the local unloading hypothesis is used. It makes possible to define smooth fields of local deformations (inverse implant field) for the mathematical formalization of incompatibility. The main outcomes are field equations, natural boundary conditions and conservation laws, derived from least action principle and variational symmetries with account of implant field. The derivations were carried out in the framework of elasticity theory for simple materials and, over and above, within the Cosserat’s theory of a two-dimensional continuum. As illustrative examples the distributions of incompatible deformations in a circular plate are considered.

For the better part of a century researchers across disciplines have sought to explain the crystallography of the elemental transition metals: hexagonal close packed, body centered cubic, and face centered cubic in a form similar to that used to rationalize the structure of organic molecules and inorganic complexes. Pauling himself tried with limited success to address the origins of transition metal stability. These early investigators were handicapped, however, by incomplete knowledge regarding the structure of metallic charge density. Here we exploit modern approaches to charge analysis to first comprehensively describe transition metal charge density. Then, we use topological partitioning and quantum mechanically rigorous treatments of kinetic energy to account for the structure of the density as arising from the interactions between metallic tetrahedra. We argue that the crystallography of the early transition metals results from charge transfer from the so called “octahedral” to “tetrahedral holes” while the face centered cubic structure of the late transition metals is a consequence of antibonding interactions that increase octahedral hole kinetic energy.

Interval-valued functions have been widely used to accommodate data inexactness in optimization and decision theory. In this paper, we study interval-valued vector optimization problems, and derive their relationships to interval variational inequality problems, of both Stampacchia and Minty types. Using the concept of interval approximate convexity, we establish necessary and sufficient optimality conditions for local strong quasi and approximate $LU$-efficient solutions to nonsmooth optimization problems with interval-valued multiobjective functions.

Variable Angle Tow (VAT) laminates offer a promising alternative to classical straight fiber composites in terms of design and performance. However, analyzing these structures can be more complex due to the introduction of new design variables. Carrera's Unified Formulation (CUF) has been successful in previous works for buckling, vibrational, and stress analysis of VAT plates. Typically, one-dimensional (1D) and two-dimensional (2D) CUF models are used, with a linear law describing the fiber orientation variation in the main plane of the structure. The objective of this article is to expand the CUF 2D plate finite elements family to perform free vibration analysis of composite laminated plate structures with curvilinear fibers. The primary contribution is the application of Reissner's Mixed Variational Theorem (RMVT) to a CUF finite element model. The Principle of Virtual Displacements (PVD) and RMVT are both used as variational statements for the study of monolayer and multilayer VAT plates dynamic behavior. The proposed approach is compared to Abaqus three-dimensional (3D) reference solutions, classical theories and literature results to investigate the effectiveness of the developed models. Results demonstrate that mixed theories provide the best approximation of the reference solution in all cases.

As one of the fastest-growing new energy sources, wind power technology has attracted widespread attention from all over the world. In order to improve the quality of wind power generation, wind speed prediction is an indispensable task. In this paper, an error correction based Variational Mode Decomposition and Broad Learning System (VMD-BLS) hybrid model is proposed for wind speed prediction. First, the wind speed is decomposed into multiple components by the VMD algorithm, and then an ARMA model is established for each component to find the optimal number of sequence divisions. Second, the BLS model is used to predict each component, and the prediction results are summed to obtain the wind speed forecast value. However, in some traditional methods, there is always time lag, which will reduce the forecast accuracy. To deal with this, a novel error correction technique is developed by utilizing BLS. Through verification experiment with actual data, it proves that the proposed method can reduce the phenomenon of prediction lag, and can achieve higher prediction accuracy than traditional approaches, which shows our method’s effectiveness in practice.

Aiming at the problem that the performance of Adaptive Kalman filter estimation will be affected when the statistical characteristics of the process and measurement noise matrix are inaccurate and time-varying in the linear Gaussian state-space model, an algorithm of Multi-fading factor and update monitoring strategy adaptive Kalman filter based variational Bayesian is proposed. Inverse Wishart distribution is selected as the measurement noise model, the system state vector and measurement noise covariance matrix are estimated with the variational Bayesian method. The process noise covariance matrix is estimated by the maximum a posteriori principle, and the update monitoring strategy with adjustment factors is used to maintain the positive semi-definite of the updated matrix. The above optimal estimation results are introduced as time-varying parameters into the multiple fading factors to improve the estimation accuracy of the one-step state predicted covariance matrix. The application of the proposed algorithm in target tracking is simulated. The results show that compared with the current filters, the proposed filtering algorithm has better accuracy and convergence performance, and realizes the simultaneous estimation of inaccurate time-varying process and measurement noise covariance matrices.

The service conditions of underground coal mine equipment are poor, and it is difficult to accurately extract the fault characteristics of rolling bearings. In order to better improve the accuracy of fault identification of rolling bearings, a fault detection method based on multiscale permutation entropy and SOA-SVM is proposed. First, the whale optimization algorithm is used to select the modal analysis number K and the penalty factor α of the variational mode decomposition algorithm. Then, the vibration signal of rolling bearings is dissolved according to the optimized variational mode decomposition algorithm, and the multi-scale permutation entropy of the main intrinsic mode function is calculated. Finally, the feature values of the matrix are entered into the SVM algorithm optimized by the seagull optimization algorithm to obtain the classification result. The experimental results based on the published rolling bearing datasets of Western Reserve University show that the identification success rate of the proposed method can reach 98.75%. The fault detection of the rolling bearings can be completed accurately and efficiently.

The Microwave Humidity and Temperature sounder (MWHTS) on board the Fengyun (FY)-3C satellite measure the outgoing radiance form the Earth surface and atmospheric constituents. MWHTS makes measurements in the isolated oxygen absorption line near 118 GHz and the vicinity of strong water vapor line around 183 GHz, can provide fine vertical distribution structure of both atmospheric humidity and temperature. However, in order to obtain the accurate soundings of humidity and temperature by the physical retrieval method, bias between the observed radiance and those simulated by radiative transfer model from the background or first guess profiles must be correct. In this study, two bias correction methods are developed through the correlation analysis between MWHTS measurements and air mass identified by the first guess profiles of the physical inversion, one is the linear regression correction (LRC) and the other is neural networks correction (NNC), representing the linear and nonlinear nature between MWHTS measurements and air mass, respectively. Both correction methods have been applied to MWHTS observed brightness temperatures over the geographic area (180° W-180° E, 60° S-60° N). The corrected results are evaluated by the probability density function of the difference between corrected observations and simulated values and the root mean square error (RMSE) with respect to simulated observations. The numerical results show that the NNC method perform better, especially in MWHTS channels 1 and 7-9 whose peak weight function heights are close to the surface. In order to assess the effects of bias correction methods proposed in this study on the retrieval accuracy, a one-dimensional variational system was built and applied to the MWHTS uncorrected and corrected brightness temperatures to estimated atmospheric temperature and humidity profiles, The retrieval results show that the NNC has better performance which is to be expected. An indication of the stability and robustness of NNC method is given which suggests that the NNC method has promising application perspectives in the physical retrieval.

In a p-uniformly convex and uniformly smooth Banach space, let the pair of variational inequality and fixed point problems (VIFPPs) consist of two variational inequality problems (VIPs) involving two uniformly continuous and pseudomonotone mappings and two fixed point problems implicating two uniformly continuous and Bregman relatively asymptotically nonexpansive mappings. This article designs two parallel subgradient-like extragradient algorithms with inertial effect for solving this pair of VIFPPs, where each algorithm consists of two parts which are of symmetric structure mutually. Under mild registrations, we prove weak and strong convergence of the suggested algorithms to a common solution of this pair of VIFPPs, respectively. Lastly, an illustrative example is furnished to verify the applicability and implementability of our proposed approaches.

Classical methods for inverse problems are mainly based on regularization theory. In particular those which are based on optimization of a criterion with two parts: a data-model matching and a regularization term. Different choices for these two terms and great number of optimization algorithms have been proposed. When these two terms are distance or divergence measures, they can have a Bayesian Maximum A Posteriori (MAP) interpretation where these two terms correspond, respectively, to the likelihood and prior probability models.

Despite the importance of few-shot learning, the lack of labeled training data in the real world, makes it extremely challenging for existing machine learning methods as this limited data set does not represent the data variance well. In this research, we suggest employing a generative approach using variational autoencoders (VAEs), which can be used specifically to optimize few-shot learning tasks by generating new samples with more intra-class variations. The purpose of our research is to increase the size of the training data set using various methods to improve the accuracy and robustness of the few-shot face recognition. Specifically, we employ the VAE generator to increase the size of the training data set, including the basic and the novel sets while utilizing transfer learning as the backend. Based on extensive experimental research, we analyze various data augmentation methods to observe how each method affects the accuracy of face recognition. We conclude that the face generation method we proposed can effectively improve the recognition accuracy rate to 96.47% using both the base and the novel sets.

Variable-Angle Tow (VAT) laminates can improve straight fiber composites mechanical properties thanks to the application of curvilinear fibers. This characteristic allows to achieve ambitious objectives for design and performance purposes. Nevertheless, the wider design space and the higher number of parameters result in a more complex structural problem. Among the various approaches that have been used for VATs study, Carrera’s Unified Formulation (CUF) allows to obtain multiple theories within the same framework, guaranteeing a good compromise between the results accuracy and the computational cost. In this article, the linear buckling behavior of VAT laminates is analyzed through the extension of CUF 2D plate models within the Reissner’s Mixed Variational Theorem (RMVT). Results show that RMVT can better approximate the prebuckling non-uniform stress field of the plate when compared to standard approaches, thus improving the prediction of the linear buckling loads of VAT composites.

We prove a version of Ekeland Variational Principle (EkVP) in a weighted graph $G$ and its equivalence to Caristi fixed point theorem and to Takahashi minimization principle. The usual completeness and topological notions are replaced with some weaker versions expressed in terms of the graph $G$. The main tool used in the proof is the OSC property for sequences in a graph. Converse results, meaning the completeness of graphs for which one of these principles holds is also considered.

In this paper, we design two inertial-type subgradient extragradient algorithms with line-search process for solving the pseudomonotone variational inequality problems (VIPs) and common fixed-point problem (CFPP) of finite Bregman relatively nonexpansive mapping and a Bregman relatively demicontractive mapping in p-uniformly convex and uniformly smooth Banach spaces, which are more general than Hilbert spaces. Under mild conditions, we derive weak and strong convergence of the suggested algorithms to a common solution of the VIPs and CFPP, respectively. Additionally, an illustrated example is furnished to back up the feasibility and implementability of our proposed methods.

In this article, we investigate the applicability of quantum machine learning for classification tasks using two quantum classifiers from the Qiskit Python environment: the Variational Quantum Classifier (VQC) and the Quantum Kernel Estimator (QKE). We evaluate the performance of these classifiers on six widely known and publicly available benchmark datasets and analyze how their performance varies with the number of samples on two artificially generated test classification datasets. As quantum machine learning is based on unitary transformations, this paper explores data structures and application fields that could be particularly suitable for quantum advantages. Hereby, we developed a data set based on concepts from quantum mechanics using the exponential map of a Lie algebra. This dataset will be made publicly available and contributes a novel contribution to the empirical evaluation of quantum supremacy. We further compared the performance of VQC and QKE on six widely applicable datasets to contextualize our results.\\ Our results demonstrate that the VQC and QKE perform better than basic machine learning algorithms such as advanced linear regression models (Ridge and Lasso). They do not match the accuracy and runtime performance of sophisticated modern boosting classifiers like XGBoost, LightGBM, or CatBoost. Therefore, we conclude that while quantum machine learning algorithms have the potential to surpass classical machine learning methods in the future, especially when physical quantum infrastructure becomes widely available, they currently lag behind classical approaches. Our investigations also show that classical machine learning approaches have superior performance classifying datasets based on group structures, compared to quantum approaches that particularly use unitary processes.\\ Furthermore, our findings highlight the significant impact of different quantum simulators, feature maps, and quantum circuits on the performance of the employed quantum estimators. This observation emphasizes the need for researchers to provide detailed explanations of their hyperparameter choices for quantum machine learning algorithms, as this aspect is currently overlooked in many studies within the field.\\ To facilitate further research in this area and ensure the transparency of our study, we have made the complete code available in a linked GitHub repository.

This paper discovers that current canonical variational principle and canonical Noether theorem of (in)finite freedom systems for different physics systems have neglected doublet extreme value processes of the general extreme value functional that both is derived by variational principle and is necessarily be taken in deriving all ( quantum ) physics laws in phase space, but which have not been done for over one century since Noether's showing her distinguished theorem, which lead to the crisis deriving all (quantum) physics laws (necessary) in phase space. We discover there is the hidden logic cycle that people assume canonical equations, and then they finally deduce canonical equations by the equivalent relation in the whole processes in all current references. We correct the current key mistake concepts that when physics systems take the variational extreme values, the appearing processes of the physics systems are real physics processes, otherwise, are virtual processes in all current references. The real physics should be what after taking the physics systems' variational extreme values, the physics systems' general extremum functional needs to further take the general extremum functional's minimum absolute extremum zero, otherwise, the appearing processes of physics systems still are virtual processes. Conservation current equations and conservation currents, in phase space, of general canonical variational principle and general canonical Noether theorem are, respectively, deduced for the first time. Using the general extremum functionals' doublet extreme value processes, the hidden logic cycle and the crisis in current canonical variational principle and current canonical Noether theorem are solved. Consequently, the new mathematical pictures, classical and quantum new physics in phase space and the new mathematical and physical doublet extremum processes for (in)finite freedom systems are discovered. General canonical variational principle and general canonical Noether theorem naturally are given, which would rewrite all the different sciences in phase space, as key tools of studying and dealing with them.

This text deals with exploring random solutions for generalized nonlinear variational inequality problems. Using the Fan-KKM theorem and Aumann's measurable selection theorem, we are able to prove the existence and uniqueness of random solution sets under the conditions of monotonicity and convexity. Additionally, we use Minty's lemma to demonstrate the compactness and convexity of the random solution sets.

Inspired by the reflective and deliberative control mechanisms used in cognitive architectures such as SOAR and Sigma, we propose an alternative decision mechanism driven by architectural appraisals allowing robots to overcome impasses. The presented work builds on and improves on our previous work on a generally applicable decision mechanism with roots in the Standard Model of the Mind and the Generalized Cognitive Hour-glass Model. The proposed decision mechanism provides automatic context-dependent switching between exploration-oriented, goal-oriented, and backtracking behavior, allowing a robot to overcome impasses. A simulation study of two applications utilizing the proposed decision mechanism is presented demonstrating the applicability of the proposed decision mechanism.

We have considered a SEIR-SEI Vector-host mathematical model which captures malaria transmission dynamics, described and built on 7-dimensional nonlinear ordinary differential equations. We compute the basic reproduction number of the model; examine the positivity and boundedness of the model compartments in a region using well established methods viz: Cauchy’s differential theorem, Birkhoff & Rota’s theorem which verifies and reveals the well-posedness, and carrying capacity of the model respectively, the existence of the Disease-Free (DFE) and Endemic (EDE) equilibrium points were determined and examined. Using the Gaussian elimination method and the Routh-hurwitz criterion, we convey stability analyses at DFE and EDE points which indicates that the DFE (malaria-free) and the EDE (epidemic outbreak) point occurs when the basic reproduction number is less than unity (one) and greater than unity (one) respectively. We obtain a solution to the model using the Variational iteration method (VIM) (an unprecedented method) to each population compartments and verify the efficacy, reliability and validity of the proposed method by comparing the respective solutions via tables and combined plots with the computer in-built Runge-kutta-Felhberg of fourth-fifths order (RKF-45). We illustrate the combined plot profiles of each compartment in the model, showing the dynamic behavior of these compartments; then we speculate that VIM is efficient and capable to conduct analysis on Malaria models and other epidemiological models.

Variational Auto-Encoders (VAEs) are deep generative models used for unsupervised learning, however their standard version is not topology-aware in practice since the data topology may not be taken into consideration. In this paper, we propose two different approaches with the aim to preserve the topological structure between the input space and the latent representation of a VAE. Firstly, we introduce InvMap-VAE as a way to turn any dimensionality reduction technique, given an embedding it produces, into a generative model within a VAE framework providing an inverse mapping into original space. Secondly, we propose the Witness Simplicial VAE as an extension of the Simplicial Auto-Encoder to the variational setup using a witness complex for computing the simplicial regularization, and we motivate this method theoretically using tools from algebraic topology. The Witness Simplicial VAE is independent of any dimensionality reduction technique and together with its extension, Isolandmarks Witness Simplicial VAE, preserves the persistent Betti numbers of a data set better than a standard VAE.

Visual Question Generation (VQG) from images is a rising research topic in both fields of natural language processing and computer vision. Although there are some recent efforts towards generating questions from images in the open domain, the VQG task in the medical domain has not been well-studied so far due to the lack of labeled data. In this paper, we introduce a goal-driven VQG approach for radiology images called VQGRaD that generates questions targeting specific image aspects such as modality and abnormality. In particular, we study generating natural language questions based on the visual content of the image and on additional information such as the image caption and the question category. VQGRaD encodes the dense vectors of different inputs into two latent spaces, which allows generating, for a specific question category, relevant questions about the images, with or without their captions. We also explore the impact of domain knowledge incorporation (e.g., medical entities and semantic types) and data augmentation techniques on visual question generation in the medical domain. Experiments performed on the VQA-RAD dataset of clinical visual questions showed that VQGRaD achieves 61.86% BLEU score and outperforms strong baselines. We also performed a blinded human evaluation of the grammaticality, fluency, and relevance of the generated questions. The human evaluation demonstrated the better quality of VQGRaD outputs and showed that incorporating medical entities improves the quality of the generated questions. Using the test data and evaluation process of the ImageCLEF 2020 VQA-Med challenge, we found that relying on the proposed data augmentation technique to generate new training samples by applying different kinds of transformations, can mitigate the lack of data, avoid overfitting, and bring a substantial improvement in medical VQG.

The classical Rotational Isomeric State (RIS) model, originally proposed by Flory, has been used to rationalize a wide range of physicochemical properties of neutral polymers. However, many weak polyelectrolytes of interest are able to regulate their charge depending on the conformational state of the bonds. Recently, it has been shown that the RIS model can be coupled with the Site Binding (SB) model, for which the ionizable sites can adopt two states: protonated or deprotonated. The resulting combined scheme, the SBRIS model, allows to analyse ionization and conformational equilibria on the same foot. In the present work this approach is extended to include pH-dependent electrostatic Long Range (LR) interactions, ubiquitous in weak polyelectrolytes at moderate and low ionic strengths. With this aim the original LR interactions are taken into account by defining effective Short Range (SR) and pH-dependent parameters, such as effective microscopic protonation constants and rotational bond energies. The new parameters are systematically calculated using variational methods. The machinery of statistical mechanics for SR interactions, including the powerful and fast transfer matrix methods, can then be applied. The resulting technique, to which we will refer as Local Effective Interaction Parameters (LEIP) method, is illustrated with a minimal model of a flexible linear polyelectrolyte containing only one type of rotating bonds. LEIP reproduces very well the pH dependence of the degree of protonation and bond probabilities obtained by semi-grand canonical Monte Carlo simulations, where LR interactions are taken explicitly into account. The reduction in the computational time in several orders of magnitude suggests that the LEIP technique could be useful in a range of areas involving linear weak polyelectrolytes, allowing direct fitting of the relevant physical parameters to the experimental quantities.

In this paper, we investigate a class of hierarchical variational inequalities (HVIPs, i.e., strongly monotone variational inequality problems defined on the solution set of multiple-set split common fixed point problems) with quasi-pseudocontractive mappings in real Hilbert spaces, which special cases can be found in many important engineering practical applications such as image recognizing, signal processing and machine learning. In order to solve HVIPs of potential application value, inspired by the primal-dual algorithm, we propose a novel accelerated cyclic iterative algorithm that combines the inertial method with a correction term and a self-adaptive step-size technique. Our approach eliminates the need for prior knowledge of the bounded linear operator norm. Under appropriate assumptions, we establish strong convergence of the algorithm. Finally, we apply our novel iterative approximation to solve multiple-set split feasibility problems and verify the effectiveness of the proposed iterative algorithm through numerical results.

In this paper we describe and exploit a geometric framework for Gibbs probability densities and the associated concepts in statistical mechanics, which unifies several earlier works on the subject, including Souriau's symplectic model of statistical mechanics, its polysymplectic extension, Koszul model, and approaches developed in quantum information geometry. We emphasize the role of equivariance with respect to Lie group actions and the role of several concepts from geometric mechanics, such as momentum maps, Casimir functions, coadjoint orbits, and Lie-Poisson brackets with cocycles, as unifying structures appearing in various applications of this framework to information geometry and machine learning. For instance, we discuss the expression of the Fisher metric in presence of equivariance and we exploit the property of the entropy of the Souriau model as a Casimir function to apply a geometric model for energy preserving entropy production. We illustrate this framework with several examples including multivariate Gaussian probability densities, and the Bogoliubov-Kubo-Mori metric as a quantum version of the Fisher metric for quantum information on coadjoint orbits. We exploit this geometric setting and Lie group equivariance to present symplectic and multisymplectic variational Lie group integration schemes for some of the equations associated to Souriau symplectic and polysymplectic models, such as the Lie-Poisson equation with cocycle.

Self-organization in complex systems is a process in which internal entropy is reduced and emergent structures appear that allow the system to function in a more competitive way with other states of the system or with other systems. It occurs only in the presence of energy gradients, facilitating energy transmission through the system and entropy production. Being a dynamic process, self-organization requires a dynamic measure and dynamic principles. The principles of decreasing unit action and increasing total action and the principle of decreasing unit entropy and increasing total entropy are dynamic variational principles that are viable to utilize in a self-organizing system. Based on this, average action efficiency can serve as a quantitative measure of the degree of self-organization. Positive feedback loops connect this measure with all other characteristics of a complex system, providing all of them with a mechanism for exponential growth, and indicating power law relationships between each of them as confirmed by data and simulations. In this study, we apply those principles and the model to agent-based simulations of ants traveling between two locations on a 2D grid. We find that those principles explain self-organization well and that the results confirm the model. We derive a compact model of ant-behavior based on the action of their trajectories, and then estimate a variety of metrics from the simulated behavior. By measuring action efficiency we can have a new answer to the question: "What is complexity and how complex is a system?". This work shows the explanatory and predictive power of those models, which can help understand and design better complex systems.

In this paper we propose and study in the setting of a Hilbert space an averaged Halpern type algorithm for approximating the solution of a common fixed point problem for a couple of nonexpansive and demicontractive mappings with a variational inequality constraint. The strong convergence of the sequence generated by the algorithm is established under feasible assumptions on the parameters involved. In particular, we also obtain the common solution of the fixed point problem for nonexpansive or demicontractive mappings and of a variational inequality problem. Our results extend and generalize various important related results in literature that were established for the pairs (nonexpansive, nonspreading) or (nonexpansive, strongly quasi-nonexpansive) mappings. Numerical tests to illustrate the superiority of our algorithm over the ones existing in literature are also reported.

The notion of Critical Point Theory has extensive application in the filed of Partial Differential Equations, one of which is studying the existence and commenting on the uniqueness and multiplicity (in case when the solution is not unique) of weak solutions to Elliptic PDEs under certain boundary conditions.\par This article provides a brief survey about specific concepts like : differentiation on Banach Spaces, maxima and minima and its applications to PDEs. Furthermore, we've discussed the notion of defining a weak topology on Banach Spaces, before introducing the Variational Principle and its applications.\par The epilogue of the article primarily deals with results which studies the existence of weak solutions to Dirichlet Boundary Value Problems under specific conditions. The most notable aspect of this article is the proof of \textit{Rabinowitz's Saddle Point Theorem} using the method of \textit{Brouwer Degree}. Readers who are highly motivated in pursuing research in any of the topics relevent to the contents of this paper will surely find the \texttt{References} section to be extremely resourceful.