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.

Sparse direction-of-arrival (DOA) estimation of wideband signal has attracted widespread researches for its unique high-resolution performance. Numerous existing methods based on sparse Bayesian learning (SBL) don’t possess the ability to enhance sparsity even if they have already enjoyed high favor among sparse recovery approaches. In view of this, we propose a novel hierarchical Bayesian prior framework that enhance sparsity evidently and derive its corresponding iterative algorithm. On analysis, the computational complexity of the iterative are less than most existing other state-of-the-art algorithms. Not only that, proposed method possesses high angular estimation precision and sparsity performance by utilizing joint sparsity of multiple measure vector (MMV) models. Last but not least, the method obtains the ability to stabilize the estimated values between different frequencies or snapshots such that flat spatial spectrum. Extensive simulation results are presented to prove the superior performance of our methods

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.

Estimating parameters for multiple datasets can be time consuming, especially when the number of datasets is large. One solution is to sample from multiple datasets simultaneously using Bayesian methods such as adaptive multiple importance sampling (AMIS). Here we use the AMIS approach to fit a von Misses distribution to multiple datasets for wind trajectories derived from a Lagrangian Particle Dispersion Model driven from a 3D meteorological data. The primary objective is to characterise the uncertainties in wind trajectories in a form that can be used as inputs for predictive models of wind-dispersed insect pests and pathogens of agricultural crops for use in evaluating risk and in planning mitigation actions. Our results show that AMIS can significantly improve the efficiency of parameter inference for multiple datasets.

In this paper we explore the known connection among sustainability, resilience, and well-being within the framework of active inference. Initially, we revisit how the notions of well-being and resilience intersect within active inference before defining sustainability. We adopt a holistic concept of sustainability denoting the enduring capacity to meet needs over time without depleting crucial resources. It extends beyond material wealth to encompass community networks, labor, and knowledge. Using the Free Energy Principle, we can emphasize the role of fostering resource renewal, harmonious system-entity exchanges, and practices that encourage self-organization and resilience as pathways to achieving sustainability, both in an agent and in collectives. We start by connecting Active Inference with well-being, building on exsiting work. We then attempt to link resilience with sustainability, asserting that resilience alone is insufficient for sustainable outcomes. While crucial for absorbing shocks and stresses, resilience must be intrinsically linked with sustainability to ensure that adaptive capacities do not merely perpetuate existing vulnerabilities. Rather, it should facilitate transformative processes that address the root causes of unsustainability. Sustainability, therefore, must manifest across extended timescales and all system strata, from individual components to the broader system, to uphold ecological integrity, economic stability, and social well-being. We explain how sustainability manifests at the level of an agent, and then at the level of collectives and systems. To model and quantify the interdependencies between resources and their impact on overall system sustainability, we introduce the application of network theory and dynamical systems theory. We emphasize the optimization of precision or learning rates through the active inference framework, advocating for an approach that fosters the elastic and plastic resilience necessary for long-term sustainability and abundance.

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.

It is increasingly common for experiments in biology and medicine to involve large numbers of hypothesis tests. A natural graphical method for visualizing these tests is to construct a histogram from the p-values of these tests. In this article, we examine the shapes, both normal and abnormal, that these histograms can take on, as well as present simple inferential procedures that help to interpret the shapes in terms of diagnosing potential problems with the experiment. We examine potential causes of these problems in detail, and discuss potential remedies. Throughout, examples of abnormal-looking p-value histograms are provided and based on case studies involving real biological experiments.

The fitting and modeling of skewed, complex, symmetric, and asymmetric datasets is an exciting research topic in many fields of applied sciences, notably lifetime, medical, and financial sciences. The Heavy tailed Nadarajah Haghighi model is introduced by compounding the heavy tailed family and Nadarajah Haghighi distribution in this paper. The so obtained model has three parameters accounting for the scale and shape of the distribution. The proposed distribution's fundamental characteristics such as probability density, cumulative distribution, hazard rate, and survival functions are provided, and several key statistical properties are established, and several entropy information measures are proposed. The estimation of model parameter is performed via the ML procedure. Further, different simulation experiments are conducted to demonstrate the performance of proposed estimator’s using some measure, like the average estimate, the average bias, and associated mean square error. Finally, we are applied our proposed model to analyze three different real datasets. In our illustration, we are compared the practicality of the recommended model with several well-known competing models.

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.

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.

This paper investigates generalized Bayesian (GB) inference in the context of a one-parameter Pareto distribution. The study focuses on the derivation of generalized Bayesian estimators (GBE) and generalized empirical Bayesian estimators (GEBE) for the parameters of the Pareto distribution using type II censored data. In addition, the study investigates a one-sample prediction approach to examine generalized Bayesian prediction (GBP) and generalized empirical Bayesian prediction (GEBP). To evaluate the performance of these estimation and prediction methods, Monte Carlo simulations were performed comparing GBE with GEBE and GBP with GEBP for different parameter values and learning rate parameters (LRP).

The free energy principle (FEP) is a mathematical and scientific principle that describes the relationship between the physical behavior of a dynamical system and the interpretation of such behavior as carrying out inference. It blurs the boundary between the ontological mode of the system of interest and the epistemological significance it acquires through its dynamic interaction with the environment. New materialism (or neo-materialism), despite lacking a single definition, refers to a range of emerging perspectives that attempt to dismantle the long-held divisions between ontology, epistemology, and even ethics, with the aim of achieving a comprehensive transformation of naturalized thinking. In this context, new materialism provides powerful tools to reframe some of the conceptual foundations of the FEP. This paper is the first in a series that aims to systematically construct a neo-materialistic perspective for the FEP, exploring its wide-ranging implications. It serves as an introduction to the series, arguing for the justification of deploying new materialism to reframe the FEP and introducing some essential concepts to be utilized in developing a neo-materialistic account of the FEP.

The spread of ideas is a fundamental concern of today’s news ecology. Understanding the dynamics of the spread of information and its co-option by interested parties is of critical importance. Research on this topic has shown that individuals tend to cluster in echo-chambers and are driven by confirmation bias. In this paper, we leverage the active inference framework to provide an in silico model of confirmation bias and its effect on echo-chamber formation. We build a model based on active inference, where agents tend to sample information in order to justify their own view of reality, which eventually leads to them to have a high degree of certainty about their own beliefs. We show that, once agents have reached a certain level of certainty about their beliefs, it becomes very difficult to get them to change their views. This system of self-confirming beliefs is upheld and reinforced by the evolving relationship between agent's beliefs and its observations, which over time will continue to provide evidence for their ingrained ideas about the world. The epistemic communities that are consolidated by these shared beliefs, in turn, tend to produce perceptions of reality that reinforce those shared beliefs. We provide an active inference account of this community formation mechanism. We postulate that agents are driven by the epistemic value that they obtain from sampling or observing the behaviors of other agents. Inspired by digital social networks like Twitter, we build a generative model in which agents generate observable social claims or posts (e.g. `tweets') while reading the socially-observable claims of other agents, that lend support towards one of two mutually-exclusive abstract topics. Agents can choose which other agent they pay attention to at each timestep, and crucially who they attend to and what they choose to read influences their beliefs about the world. Agents also assess their local network’s perspective, influencing which kinds of posts they expect to see other agents making. The model was built and simulated simulated using the freely-available Python package pymdp. The proposed active inference model can reproduce the formation of echo-chambers over social networks, and gives us insight into the cognitive processes that lead to this phenomenon.

Probabilistic inference problems have very broad practical applications. To solve this kind of problems under conditions of certainty, an effective mathematical apparatus has been developed. In real situations, obtaining deterministic estimates of relevant probabilities is often difficult; therefore, problems with handling uncertain estimates of probabilities appear. This paper examines the problem of probabilistic inference with probability trees provided that the initial probabilities are given in the form of intervals of their possible values.

A general framework for inference in dynamical systems is described, based on the language of Bayesian probability theory and making use of the maximum entropy principle. Taking as fundamental the concept of a path, the continuity equation and Cauchy's equation for fluid dynamics arise naturally, while the specific information about the system can be included using the Maximum Caliber (or maximum path entropy) principle.

This paper investigates the periodic and quasi-periodic orbits in the symmetric collinear four-body problem through a variational approach. In Section 3, we analyze the conditions under which homographic solutions minimize the action functional. We demonstrate that these solutions for four equal masses arranged in a linear configuration are indeed the minimizers of the action functional and compute the minimum value of the action functional for these solutions. Additionally, we employ numerical experiments using Poincaré sections to explore the existence and stability of periodic and quasi-periodic solutions within this dynamical system. Our results provide a deeper understanding of the variational principles in celestial mechanics and reveal complex dynamical behaviors that are crucial for further studies in multi-body problems. The findings have significant implications for theoretical research and practical applications in astrodynamics and space mission planning.

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.

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.

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.

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.

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.

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

Generalized Bayesian (GB) is a Bayesian approach based on the learning rate parameter (LRP) () as a fraction of the power of the likelihood function. In this paper, we consider the GB method to perform inference studies for a class of exponential distributions. Generalized Bayesian estimators (GBE) and generalized empirical Bayesian estimators (GEBE) for the parameters of the considered distributions were obtained based on the censored type II samples. In addition, generalized Bayesian prediction (GBP) and generalized empirical Bayesian prediction (GEBP) were considered using a one-sample prediction scheme. Monte Carlo simulations were performed to compare the performance of the GBE and GEBE estimation results and the GBP and GEBP prediction results for different values of the LRP.

In this article we introduce an extension of the Akash distribution. We use the slash 1 methodology to make the kurtosis of the Akash distribution more flexible. We study the general 2 density of this new distribution, some properties, moments, coefficients of asymmetry and kurtosis. 3 Statistical inference is performed using the methods of moments and maximum likelihood via the 4 EM algorithm. A simulation study is carried out to observe the behavior of the maximum likelihood 5 estimator. An application to a real data set with high kurtosis is considered, where it is shown that 6 the new distribution fits better than other extensions of the Akash distribution.

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.

In this paper, we unite concepts from Husserlian phenomenology, the active inference framework in theoretical biology, and category theory in mathematics to develop a comprehensive framework for understanding social action premised on shared goals. We begin with an overview of Husserlian phenomenology, focusing on aspects of inner time consciousness, namely, retention, primal impression, and protention. We then review active inference as a formal approach to modeling agent behavior, based on variational (approximate Bayesian) inference. Expanding upon Husserl’s model of time consciousness, we consider collective goal-directed behavior, emphasizing shared protentions among agents and their connection to the shared generative models of active inference. This integrated framework aims to formalize shared goals in terms of shared protentions, and to thereby shed light on the emergence of group intentionality. Building on this foundation, we incorporate mathematical tools from category theory; particularly, sheaf and topos theory, to furnish a mathematical image of individual and group interactions within a stochastic environment. Specifically, we employ morphisms between polynomial representations of individual agent models, allowing predictions not only of their own behaviors but also those of other agents and environmental responses. Sheaf and topos theory facilitate the construction of coherent agent worldviews and provides a way of representing consensus or shared understanding. We explore the emergence of shared protentions, bridging the phenomenology of temporal structure, multi-agent active inference systems, and category theory. Shared protentions are highlighted as pivotal for coordination and achieving common objectives. We conclude by acknowledging the intricacies stemming from stochastic systems and uncertainties in realizing shared goals.

The mutual information between the state of a neural network and the state of the external world represents the amount of information stored in the neural network that is associated with the external world. In contrast, the surprise of the sensory input indicates the unpredictability of the current input. In other words, this is a measure of inference ability, and an upper bound of the surprise is known as the variational free energy. According to the free-energy principle (FEP), a neural network continuously minimizes the free energy to perceive the external world. For the survival of animals, inference ability is considered to be more important than simply memorized information. In this study, the free energy is shown to represent the gap between the amount of information stored in the neural network and that available for inference. This concept involves both the FEP and the infomax principle, and will be a useful measure for quantifying the amount of information available for inference.

Convolutional neural networks (CNNs) have proven to be a very efficient class of machine learning (ML) architectures for handling multidimensional data by maintaining data locality, especially in the field of computer vision. Data pooling, a major component of CNNs, plays a crucial role for extracting important features of the input data and downsampling its dimensionality. Multidimensional pooling, however, is not efficiently implemented in existing ML algorithms. In particular, quantum machine learning (QML) algorithms have a tendency to ignore data locality for higher dimensions by representing/flattening multidimensional data as simple one-dimensional data. In this work, we propose using the quantum Haar transform (QHT) and quantum partial measurement for performing generalized pooling operations on multidimensional data. We present the corresponding decoherence-optimized quantum circuits for the proposed techniques along with their theoretical circuit depth analysis. Our experimental work was conducted using multidimensional data, ranging from 1-D audio data, to 2-D image data, to 3-D hyperspectral data, to demonstrate the scalability of the proposed methods. In our experiments, we utilized both noisy and noise-free quantum simulations on a state-of-the-art quantum simulator from IBM Quantum. We also show the efficiency of our proposed techniques for multidimensional data by reporting the fidelity of results.

We investigate the use of amplitude amplification on the gate-based model of quantum computing as a means for solving combinatorial optimization problems. This study focuses primarily on QUBO (quadratic unconstrained binary optimization) problems, which are well-suited for qubit superposition states. Specifically, we demonstrate circuit designs which encode QUBOs as ‘cost oracle’ operations UC, which when combined with the standard Grover diffusion operator Us lead to high probabilities of measurement for states corresponding to the optimal and near optimal solutions. In order to achieve these probabilities, a single scalar parameter ps is required, which we show can be found through a variational quantum-classical hybrid approach.

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.

Phylogenomics has enriched our understanding that the Tree of Life can have network-like or reticulate structures among some taxa and genes. Non-vertical modes of evolution—such as hybridization/introgression and horizontal gene transfer—deviate from a strictly bifurcating tree model, causing non-treelike patterns. Here, we present a brief overview of a phylogenomic workflow for inferring organismal histories and compare methods for detecting reticulate evolution. We discuss how the timing of coalescent events can help disentangle introgression from incomplete lineage sorting and how horizontal gene transfer events can help determine the relative timing of speciation events. In doing so, we identify pitfalls of certain methods and discuss how to extend their utility across the Tree of Life. Workflows, methods, and future directions discussed herein underscore the need to embrace reticulate evolutionary patterns for understanding the timing and rates of evolutionary events, providing a clearer understanding of life’s history.

Coastal marine ecosystems worldwide, like Florida Bay, are increasingly affected by tide alteration and anthropogenic disturbances which affect water quality imbalance leading to algal blooms. Increased bloom persistence is a serious threat due to the long-lasting impact on processes like carbon cycle and services like species presence. However, exploring eco-environmental feedback patterns of algal blooms remains challenging and poorly investigated, also due to the paucity of data. Florida Bay, taken as an epitome, has long experienced algal blooms in its central and western regions, and in 2006 an unprecedented bloom occurred in the eastern habitats. We analyzed the occurrence of blooms from three perspectives: (1) the spatial spreading networks of chlorophyll-a (CHLa) that pinpoints source and unbalanced habitats; (2) the fluctuations of water quality factors pre- and post-bloom outbreaks to in assess environmental impacts of ecological dysbiosis and target prevention and control of algal of blooms; and (3) the biogeochemical-spreading network topological co-evolution to quantify ecosystemic stability and ecological shift likelihood in long-term. Here, we propose Transfer Entropy (TE) to quantify dynamical interactions between spatial areas and biogeochemical factors (ecosystem connectome) underpinning bloom emergence and spreading, as well as environmental effects; the Pareto principle is defined for identifying the salient eco-environmental interactions of CHLa. We quantified the spatial dynamics of algal blooms, and thus obtained areas in need for ecological monitoring and potential bloom control. Results show that algal blooms are increasingly persistent over space with long-term negative effects on water quality factor. A dichotomy is reported between spatial ecological corridors of spreading and biogeochemical networks as well as divergence from the optimal eco-organization: randomization of the former due to nutrients' overload and temperature increase leads to scale-free CHLa spreading and extreme outbreaks a posteriori. Subsequently this increases bloom persistence, turbidity and salinity with potentially strong ecological effects on highly biodiverse and vulnerable areas such as tidal flats and marshes. Algal blooms are important ecosystem regulators of nutrient cycles; however, beyond limit chlorophyll-a outbreaks cause aquatic species mortality due to their effect on water turbidity, nutrient balance (nitrogen and phosphorus in particular), salinity and temperature. Beyond compromising local environmental quality, socio-ecological services are also compromised at large scales, yet ecological assessment models like the one presented are in need of application in subtropical and tropical bays worldwide.

In recent years, large language models have demonstrated remarkable performance across various natural language processing (NLP) tasks. However, deploying these models for real-world applications often requires efficient inference solutions to handle the computational demands. In this paper, we explore the utilization of CPUs for accelerating the inference of large language models. Specifically, we introduce a parallelized approach to enhance throughput by 1) Exploiting the parallel processing capabilities of modern CPU architectures, 2) Batching the inference request. Our evaluation shows the accelerated inference engine gives an 18-22x improvement in the generated token per sec. The improvement is more with longer sequence and larger models. In addition to this, we can also run multiple workers in the same machine with NUMA node isolation to further improvement in tokens/s. Table 2, we have received 4x additional improvement with 4 workers. This would also make Gen-AI based products and companies’ environment friendly, our estimates shows that CPU usage for Inference could reduce the power consumption of LLMs by 48.9% (1252 W for A100 with AMD EPYC 7V13 vs 613 W for Intel® Xeon® Gold 6538N) while providing production ready throughput & latency.

In this paper, we shall introduce the interval-valued spatial error model. Based on the idea of least square method of single-valued case, we give the parameter estimator for interval-valued spatial error model. The theoretical properties of the proposed estimator are proved. Finally, we give the numerical analysis and a real example.

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.

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.

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.

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.

The human-readable simplicity with which the CSV format was devised, together with the absence of a standard that strictly defines this format, has allowed the proliferation of several variants in the dialects with which these files are written. The latter has meant that the exchange of information between data management systems, or between countries and regions, requires human intervention during the data mining and cleansing process. This has led to the development of various computational tools that aim to accurately determine the dialects of CSV files, in order to avoid data loss at data loading stage in a given system. However, the dialect detection is a complex problem and current systems have limitations or make assumptions that need to be improved and/or extended. This paper proposes a method for determining CSV file dialects through table uniformity, a statistical approach based on table consistency and records dispersion measurement along with the detection of data type over each field. The new method has a 100\% accuracy on a dataset with 148 CSV files composed of samples coming from a data load testing framework and some others added as verification of the parsing routines. In tests on truly messy data, the proposed solution outperforms the state-of-the-art tool by achieving an improvement of about 10\% in the accuracy with which dialects are detected. Furthermore, the proposed method is accurate enough to determine dialects by reading only ten records, requiring more data to disambiguate those cases where the first records do not contain the necessary information to conclude with a dialect determination.

We present a formalism to assess the safety of the COVID19 vaccines and infer a causal relation between vaccine administration and adverse effects, in particular death. We use data on adverse effects from VAERS covering the time interval [01-10-2020, 31-12-2021] (downloaded on 1 Feb 2022). We measure a vaccine fatality rate of order 0.01 for all vaccine manufacturers and identify a strong heterogeneity in the vaccine toxicity across vaccine lots, spanning up to four orders of magnitude. We compute the correlation between vaccination dates and death dates, and produce an estimate of the time lag that maximises the correlation, finding that the onset of adverse effects happened statistically (i.e. 32-41 percentiles) within one day after the vaccine administration and that death happened statistically (i.e. 22-50 percentiles) within about two weeks after the vaccine administration. These results provide data-based insights that can guide public health measures and health insurance policies.

The effectiveness of Fuzzy Inference Systems (FISs) in manipulating uncertainty and nonlinearity makes them a subject of significant interest for decision-making in embedded systems. Accordingly, optimizing FIS hardware improves its performance, efficiency, and capabilities, leading to a better user experience, increased productivity, and cost savings. To be compatible with the limited power budget in most embedded systems, this paper presents a framework to realize ultra-low power FIS hardware. It supports optimizations for both conventional arithmetic as well as MSDF-computing to be highly consistent with MSDF-based sensors. In MSDF-computing FIS all the processes of fuzzification, inference, and defuzzification are done on serially coming data bits. To demonstrate the efficiency of the proposed framework, we utilized Matlab, Chisel3, and Vivado to implement it from high-level descriptions of FIS to hardware synthesis. We also developed a Scala library in Chisel3 to establish a connection between these tools, bridging the gap, and facilitating design space exploration at the arithmetic level. Furthermore, we realized an FIS for the navigation of autonomous mobile robots in unknown environments. Synthesis results show the superiority of the output of our suggested design framework in terms of resource usage as well as power and energy consumption compared to the Matlab HDL code generator output.

Safety is very important in aviation since a loss of safety frequently results in both fatalities and financially damaging situations that are typically unrecoverable. Thus, achieving safety as much as possible is the primary goal of practically all aviation technology work. In this study, an Adaptive Neuro-Fuzzy Inference System (ANFIS)-based classifier is created to estimate the fault risk factor of airplanes. Five categories of real fleet data belonging to structure, electrical, avionic, motor systems, and incident statistics of the planes have been used for classifier development. A risk factor determination for each plane is the output of the developed intelligent classifier, and it can be used to identify general overhaul candidate planes and stop defects and crashes before they happen. The obtained results show that using ANFIS provides a great capability in processing many inputs and outputs depending on different types and classes in the aviation industry and thus predicting the failure risk of the airplane efficiently.

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

In recent years, Edge Intelligence (EI) has emerged, combining edge computing with AI, specifically deep learning, to run AI algorithms directly on edge devices. In practical applications, EI faces challenges related to computational power, power consumption, size, and cost, with the primary challenge being the trade-off between computational power and power consumption. This has rendered traditional computing platforms unsustainable, making heterogeneous parallel computing platforms a crucial pathway for implementing EI. In our research, we leveraged the Xilinx Zynq 7000 heterogeneous computing platform, employed High-Level Synthesis (HLS) for design, and implemented two different accelerators for LeNet-5 using loop unrolling and pipelining optimization techniques. The experimental results show that when running at a clock speed of 100 MHz, the PIPELINE accelerator, compared to the UNROLL accelerator, experiences an 8.09% increase in power consumption but speeds up by 14.972 times, making the PIPELINE accelerator superior in performance. Compared to the CPU, the PIPELINE accelerator reduces power consumption by 91.37% and speeds up by 70.387 times, while compared to the GPU, it reduces power consumption by 93.35%.This study provides two different optimization schemes for edge intelligence applications through design and experimentation, and demonstrates the impact of different quantization methods on FPGA resource consumption. These experimental results can provide a reference for practical applications, thereby providing a reference hardware acceleration scheme for edge intelligence applications.

This work presents significant results obtained by the application of global optimization techniques to the design of finite, normal form games with mixed strategies. To that end, the Fuzzy ASA global optimization method is applied to several design examples of strategic games, demonstrating its effectiveness in obtaining payoff functions whose corresponding games present a previously established Nash equilibrium. In other words, the game designer becomes able to choose a convenient Nash equilibrium for a generic finite state strategic game and the proposed method computes payoff functions that will realize the desired equilibrium, making it possible for the players to reach the favorable conditions represented by the chosen equilibrium. Considering that game theory is a very significant approach for modeling interactions between competing agents, and Nash equilibrium represents a powerful solution concept, portraying situations in which joint strategies are optimal in the sense that players cannot benefit from individually modifying their current strategies provided that other players do not change their strategies as well, it is natural to infer that the proposed method may be very useful for strategists in general. In summary, it is a genuine instance of artificial inference of payoff functions after a process of global machine learning, applied to their numerical components.

In the era of big data with increasingly complex data structures and ever-larger data scales, matrix-type data are becoming highly valued and their applications in the fields of medicine, industry, education, geography, and astronomy are growing in extent. In recent years, significant progress has been made in the practical use of matrix variable t-distribution finite mixture models for handling data in order to address the issues of multi-subgroup structures and long data tails. In this paper, the expectation-maximization (EM) algorithm with penalized maximum likelihood is proposed to resolve the problem of the unbounded nature of the likelihood function applied to the model by considering the degeneracy of the variance-covariance matrix of this model. Our data were analyzed through simulations and real data, and the results demonstrate that our model is effective in both preventing the likelihood function from being unbounded and in ensuring the accuracy of the estimated parameters of the EM algorithm.

Computer systems are involved in many critical human applications today, so that a small error can lead to serious and dangerous problems. These errors can be from an error in the incorrect design of the user interface to an error in the program code. The success of a software product depends on several factors. Given that different organizations and institutions use software products, the need to have a quality and desirable Software according to the goals and needs of the organization makes measuring the quality of software products. an important issue for most organizations and institutions, To be sure of having the right software. It is necessary to use a standard quality model to examine the features and sub-features for a detailed and principled study in the quality discussion. In this study, the quality of Word software was measured by Adaptive Neural Fuzzy Inference System. In recent years, powerful systems called fuzzy inference systems on The basis of adaptive neural network (ANFIS) has been used in various sciences. Using the power of neural network training and the linguistic advantage of fuzzy systems, these types of systems have been able to realize the advantages of the two in terms of analyzing very powerful complex processes. Considering the importance of software quality and to have a good and usable software in terms of quality and measuring the quality of software during the study. It was applied at different levels to make the result of measuring the quality of Word software more accurate and closer to reality. In this research, the quality of the software product is measured based on the adaptive neural-fuzzy inference system in ISO standard. According to the results obtained in this study, it is understood that quality is a continuous and hierarchical concept and the quality of each part of the software at any stage of production can lead to high quality products.

The maximization of entropy S within a closed system is accepted as an inevitability (as the second law of thermodynamics) by statistical inference alone. The Maximum Entropy Production Principle (MEPP) states that not only S maximizes, but $\dot{S}$ as well: a system will dissipate as fast as possible. There is still no consensus on the general validity of this MEPP, even though it shows remarkable explanatory power (both qualitatively and quantitatively), and has been empirically demonstrated for many domains. In this theoretical paper I provide a generalization of entropy gradients, to show that the MEPP actually follows from the same statistical inference, as that of the 2nd law of thermodynamics. For this generalization I only use the concepts of super-statespaces and microstate-density. These concepts also allow for the abstraction of 'Self Organizing Criticality' to a bifurcating local difference in this density, and allow for a generalization of the fundamentally unresolved concepts of 'chaos' and 'order'.

Medical insurance claims are becoming increasingly common data sources to answer a variety of questions in biomedical research. Although comprehensive in terms of longitudinal characterization of disease development and progression for a potentially large number of patients, population-based studies using these datasets require thoughtful modification to sample selection and analytic strategies, relative to other types of studies. Along with complex selection bias and missing data issues, claims-based studies are purely observational, which limits effective understanding and characterization of the treatment differences between groups being compared. All these issues contribute to a crisis in reproducibility and replication of comparative findings. This paper offers some practical guidance to the full analytical process, demonstrates methods for estimating causal treatment effects on several types of outcomes common to such studies, such as binary, count, time to event and longitudinally varying repeated measures outcomes, and aims to increase transparency and reproducibility. We provide an online version of the paper with readily implementable code for the entire analysis pipeline to serve as a guided tutorial for practitioners. The online version can be accessed at https://rydaro.github.io/. The analytic pipeline is illustrated using a sub-cohort of patients with advanced prostate cancer from the large Clinformatics TM Data Mart Database (OptumInsight, Eden Prairie, Minnesota), consisting of 73 million distinct private payer insurees from 2001-2016.

Accurate streamflow forecasting is crucial for effectively managing water resources, particularly in countries like Colombia, where hydroelectric power generation significantly contributes to the national energy grid. Although highly interpretable, traditional deterministic, physically-driven models often suffer from complexity and require extensive parameterization. Data-driven models like Linear Autoregressive (LAR) and Long Short-Term Memory (LSTM) networks offer simplicity and performance but cannot quantify uncertainty. This work introduces Sparse Variational Gaussian Processes (SVGPs) for forecasting streamflow contributions. The proposed SVGP model reduces computational complexity compared to traditional Gaussian Processes, making it highly scalable for large datasets. The methodology employs optimal hyperparameters and shared inducing points to capture short-term and long-term relationships among reservoirs. Training, validation, and analysis of the proposed approach consider the streamflow dataset from 23 geographically dispersed reservoirs recorded during twelve years in Colombia. Performance assessment reveals that the proposal outperforms baseline Linear Autoregressive (LAR) and Long Short-Term Memory (LSTM) models in three key aspects: adaptability to changing dynamics, provision of informative confidence intervals through Bayesian inference, and enhanced forecasting accuracy. Therefore, the SVGP-based forecasting methodology offers a scalable and interpretable solution for multi-output streamflow forecasting, thereby contributing to more effective water resource management and hydroelectric planning.

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 overview the main equations of the Rayleigh-Ritz variational method and discuss their connection with the problem of simultaneous diagonalization of two Hermitian matrices.

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, we study a co-variational inequality problem involving Yosida approximation operators in real uniformly smooth Banach space and define an iterative method to obtain its solution. We prove some properties of Yosida approximation operator for our purpose, that is strongly accretivity and Lipschitz continuity. An existence as well as convergence result is proved for co-variational inequality problem involving Yosida approximation operators using the concept of nonexpansive sunny retraction.

We develop an action principle to construct the field equations for dissipative/resistive general relativistic two-temperature plasmas, including a neutrally charged component. The total action is a combination of four pieces: an action for a multi-fluid/plasma system with dissipation/resistivity and entrainment; the Maxwell action for the electromagnetic field; the Coulomb action with a minimal coupling of the four-potential to the charged fluxes; and the Einstein-Hilbert action for gravity (with the metric being minimally coupled to the other action pieces). We use a pull-back formalism from spacetime to abstract matter spaces to build unconstrained variations for the neutral, positively, and negatively charged fluid species and for three associated entropy flows. The full suite of field equations is recast in the so-called ``$3 + 1$'' form (suitable for numerical simulations), where spacetime is broken up into a foliation of spacelike hypersurfaces and a prescribed ``flow-of-time''. A previously constructed phenomenological model for the resistivity is updated to include the modified heat flow and the presence of a neutrally charged species. We impose baryon number and charge conservation as well as the Second Law of Thermodynamics in order to constrain the number of free parameters in the resistivity. Finally, we take the Newtonian limit of the ``$3 + 1$'' form of the field equations which can be compared to existing non-relativistic formulations. Applications include main sequence stars, neutron star interiors, accretion disks, and the early universe.

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.

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.

Attention-Deficit/Hyperactivity Disorder (ADHD) is traditionally conceptualized within a framework emphasizing deficits in attention regulation and executive function. However, emerging evidence from the fields of predictive coding and active inference offers a novel lens through which to understand ADHD not merely as a disorder of attention but as a distinctive mode of neurodevelopmental variation. This article synthesizes current research and theoretical models to propose a redefined understanding of ADHD. By integrating insights from Ryan Smith, Paul B. Badcock, and Karl J. Friston (2020), we explore the premise that individuals with ADHD exhibit unique differences in how their brains generate and update predictions about the environment, leading to the characteristic behavioral patterns observed in ADHD. We argue that ADHD involves a divergence in the brain's predictive models and its ability to minimize prediction error, impacting sensory processing, attention allocation, and motor control. This perspective illuminates the adaptive aspects of ADHD, suggesting that what are often labeled as deficits could also reflect an adaptive fit to certain environmental contexts, underscoring the role of neurodiversity in human evolution. Furthermore, we discuss the implications of this reconceptualization for clinical practice, including diagnosis, treatment, and support for individuals with ADHD, emphasizing approaches that align with their unique neurocognitive profiles. This article calls for a shift in the narrative surrounding ADHD, advocating for a model that appreciates the complexity and adaptiveness of neurodevelopmental diversity.

Reliable quantification of pulmonary arterial pressure is essential in the diagnostic and prognostic assessment of a range of cardiovascular pathologies including rheumatic heart disease, yet an accurate and routinely available method for its quantification remains elusive. This work proposes an approach to infer pulmonary arterial pressure based on scientific machine learning techniques and non-invasive, clinically available measurements. A 0-D multicompartment model of the cardiovascular system was optimized using several optimization algorithms, subject to forward-mode automatic differentiation. Measurement data were synthesized from known parameters to represent the healthy, mitral regurgitant, aortic stenosed and combined valvular disease situations with and without pulmonary hypertension. Eleven model parameters were selected for optimization based on 95 % explained variation in mean pulmonary arterial pressure. A hybrid Adam and limited-memory Broyden-Fletcher-Goldfarb-Shanno optimizer yielded the best results with input data including valvular flow rates, heart chamber volume changes and systematic arterial pressure. Mean absolute percentage errors ranged from 1.8 % to 3.78 % over the simulated test cases. The model was able to capture pressure dynamics under hypertensive conditions with pulmonary arterial systole, diastole, and mean pressure average percentage errors of 1.12 %, 2.49 % and 2.14 %, respectively. The relatively low errors highlight the potential of the proposed model to recover pulmonary pressures for diseased heart valve and pulmonary hypertensive conditions.

An approach to the assessment of probabilistic inference is described which quantifies the performance on the probability scale. From both information and Bayesian theory, the central tendency of an inference is proven to be the geometric mean of the probabilities reported for the actual outcome and is referred to as the “Accuracy.” Upper and lower error bars on the accuracy are provided by the arithmetic mean and the -2/3 mean. The arithmetic is called the “Decisiveness” due to its similarity with the cost of a decision and the -2/3 mean is called the “Robustness”, due to its sensitivity to outlier errors. Visualization of inference performance is facilitated by plotting the reported model probabilities versus the histogram calculated source probabilities. The visualization of the calibration between model and source is summarized on both axes by the arithmetic, geometric, and -2/3 means. From information theory, the performance of the inference is related to the cross-entropy between the model and source distribution. Just as cross-entropy is the sum of the entropy and the divergence; the accuracy of a model can be decomposed into a component due to the source uncertainty and the divergence between the source and model. Translated to the probability domain these quantities are plotted as the average model probability versus the average source probability. The divergence probability is the average model probability divided by the average source probability. When an inference is over/under-confident, the arithmetic mean of the model increases/decreases, while the -2/3 mean decreases/increases, respectively.

Studies employing Arellano-Bond and Blundell-Bond GMM estimation for single linear dynamic panel data models are growing exponentially in number. However, for researchers it is hard to make a reasoned choice between many different possible implementations of these estimators and associated tests. By simulation the effects are examined of many options regarding: (i) reducing, extending or modifying the set of instruments; (ii) specifying the weighting matrix in relation to the type of heteroskedasticity; (iii) using (robustified) 1-step or (corrected) 2-step variance estimators; (iv) employing 1-step or 2-step residuals in Sargan-Hansen overall or incremental overidentification restrictions tests. This is all done for models in which some regressors may be either strictly exogenous, predetermined or endogenous. Surprisingly, particular asymptotically optimal and relatively robust weighting matrices are found to be superior in finite samples to ostensibly more appropriate versions. Most of the variants of tests for overidentification restrictions show serious deficiencies. A recently developed modification of GMM is found to have great potential when the cross-sectional heteroskedasticity is pronounced and the time-series dimension of the sample not too small. Finally all techniques are employed to actual data and lead to some profound insights.

Deep learning heavily relies on statistical correlations to drive artificial intelligence (AI) innovations, particularly in computer vision applications like autonomous driving and robotics. However, despite providing a solid foundation for deep learning, these statistical correlations can be vulnerable to unforeseen and uncontrolled factors. The lack of prior knowledge guidance can result in spurious correlations, introducing confounding factors and affecting the model's robustness. To address this challenge, recent research efforts have focused on integrating causal theory into deep learning methodologies. By modelling the inherent and unbiased causal structure, causal theory can potentially mitigate the impact of spurious correlations effectively. Hence, this paper explores the basics of causal methodologies in image classification.

The description of stellar interiors remains as a big challenge for the nuclear astrophysics community. The consolidated knowledge is restricted to density regions around the saturation of hadronic matter $\rho _{0} = 2.8\times 10^{14} {\rm\ g\ cm^{-3}}$, regimes where our nuclear models are successfully applied. As one moves towards higher densities and extreme conditions up to five to twenty times $\rho_{0}$, little can be said about the microphysics of such obejects. Here, we employ an MCMC strategy in order to access the variability of polytropic three-pircewised models for neutron star equation of states. With a fixed description of the hadronic matter we explore a variety of models for the high density regimes leading to stellar masses up to 2.5 $M_{\odot}$. In addition, we also discuss the use of a Bayesian power regression model with heteroscedastic error. The set of EoS from LIGO was used as inputs and treated as data set for testing case.

This paper investigates an inverse problem of option pricing in the extended Black--Scholes model. We identify the model coefficients from the measured data and attempt to find arbitrage opportunities in financial markets using a Bayesian inference approach. The posterior probability density function of the parameters is computed from the measured data. The statistics of the unknown parameters are estimated by Markov Chain Monte Carlo (MCMC), which explores the posterior state space. The efficient sampling strategy of MCMC enables us to solve inverse problems by the Bayesian inference technique. Our numerical results indicate that the Bayesian inference approach can simultaneously estimate the unknown drift and volatility coefficients from the measured data.

What is the function of cognition? On one influential account, cognition evolved to co-ordinate behaviour with environmental change or complexity (Godfrey-Smith 1996). Liberal interpretations of this view ascribe cognition to an extraordinarily broad set of biological systems – even bacteria, which modulate their activity in response to salient external cues, would seem to qualify as cognitive agents. However, equating cognition with adaptive flexibility per se glosses over important distinctions in the way biological organisms deal with environmental complexity. Drawing on contemporary advances in theoretical biology and computational neuroscience, we cash these distinctions out in terms of different kinds of generative models, and the representational and uncertainty-resolving capacities they afford. This analysis leads us to propose a formal criterion for delineating cognition from other, more pervasive forms of adaptive plasticity. On this view, biological cognition is rooted in a particular kind of functional organisation; namely, that which enables the agent to detach from the present and engage in counterfactual (active) inference.

We compare the well known Rayleigh-Ritz variational method (RRVM) with a recently proposed approach based on supersymmetric quantum mechanics and the Gram-Schmidt orthogonalization method (SSQMGS). We apply both procedures to a particular class of double-well harmonic oscillators that had been conveniently chosen for the application of the latter approach. The RRVM eigenvalues converge smoothly from above providing much more accurate results with less computational effort. Present results show that the unproved SSQMGS upper bounds do not hold.

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.

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.

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.

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 complex systems constrained by multiple factors, it is of great significance to accurately identify the key influencing factors for mastering the evolution and development law of the system and obtaining scientific decision-making suggestions or schemes. At present, the method based on experimental simulation is limited by the difficulty of system model construction; the method based on decision trial and Evaluation laboratory (DEMATEL) involves a wide range of subjects and is greatly influenced by subjective factors. In view of this, we propose a novel model based on heuristic causal inference. The model uses the FCI algorithm with prior knowledge to learn the global causal network among multiple factors of the complex system. The causal effect among variables in the causal network is calculated by using heuristic causal inference method. Specifically, the causal path contribution degree of cause variable to target variable is calculated to replace the causal effect of each cause variable to target variable. The key influencing factors in the system are screened out according to the contribution degree of causal pathways. Based on the dataset generated in the production process of a semiconductor manufacturing system, we carried out simulation experiments, identified several factors that have a key impact on product quality, and proved the feasibility and effectiveness of the proposed model.

A Mamdani-type fuzzy-logic model has been developed to link Mediterranean seagrass abundance to the prevailing environmental conditions. Big Databases, as UNEP-WCMC (seagrass abundance), CMEMS and EMODnet (oceanographic/environmental) and human-impact parameters were utilized for this expert system. Model structure and input parameters were tested according to their capacity to accurately predict seagrass families at specific locations. The optimum FIS comprised of four input variables: water depth, sea surface temperature and nitrates and bottom chlorophyll-a concentration, exhibiting fair accuracy (76%). Results illustrated that Posidoniaceae prefers cool (16-18oC) and low chlorophyll-a presence (< 0.2 mg/m3); Zosteraceae favors cool (16-18oC) and mesotrophic waters (Chl-a > 0.2 mg/m3), but also slightly warmer (18-19.5 oC) with lower Chl-a levels (< 0.2 mg/m3); Cymodoceaceae lives from warm, oligotrophic (19.5-21.0oC and Chl-a < 0.3 mg/m3) to moderately warm mesotrophic sites (18-21.3oC and 0.3 – 0.4 mg/m3 Chl-a). Finally, Hydrocharitaceae thrives in warm Mediterranaean waters (21-23oC) of low chlorophyll-a content (< 0.25 mg/m3). Climate change scenarios showed that Posidoniaceae and Zosteraceae tolerate bathymetric changes, Posidoniaceae and Zosteraceae are mostly affected by sea temperature rise, while Hydrocharitaceae exhibits tolerance in higher sea temperature rise. This FIS could be used by national and regional policy-makers and public authorities.

In this study, based on our previous study, we examined the mathematical properties, especially the stability of the equilibrium for our proposed mathematical model. By means of the results of the stability in this study, we also used actual data representing transient booms and resurgent booms, and conducted parameter estimation for our proposed model using Bayesian inference. In addition, we conducted a model fitting to five actual data. By this study, we reconfirmed that we can express the resurgences or minute vibrations of actual data by means of our proposed model.

In the past few decades, probabilistic interpretations of brain functions have become widespread in cognitive science and neuroscience. In particular, the free energy principle and active inference are increasingly popular theories of cognitive functions that claim to offer a unified understanding of life and cognition within a general mathematical framework derived from information and control theory, and statistical mechanics. However, we argue that if the active inference proposal is to be taken as a general process theory for biological systems, it is necessary to understand how it relates to existing control theoretical approaches routinely used to study and explain biological systems. For example, recently, PID control has been shown to be implemented in simple molecular systems and is becoming a popular mechanistic explanation of behaviours such as chemotaxis in bacteria and amoebae, and robust adaptation in biochemical networks. In this work, we will show how PID controllers can fit a more general theory of life and cognition under the principle of (variational) free energy minimisation when using approximate linear generative models of the world. This more general interpretation provides also a new perspective on traditional problems of PID controllers such as parameter tuning as well as the need to balance performances and robustness conditions of a controller. Specifically, we then show how these problems can be understood in terms of the optimisation of the precisions (inverse variances) modulating different prediction errors in the free energy functional.

The storm 'Daniel' has caused the most severe flood phenomenon that Greece has ever experienced, with thousands of hectares of farmland submerged for days. This led to sediment deposition in the inundated areas, which significantly altered the chemical properties of the soil, as revealed by extensive soil sampling and laboratory analysis. Causal relationships between soil chemical properties and sediment deposition were extracted using the DirectLiNGAM algorithm. Results of causality analysis showed that the sediment deposition affected the CaCO3 concentration in the soil. Also, causal relationships were identified between CaCO3 and available phosphorus (P-Olsen), as well as between sediment deposit depth and available manganese. The quantified relationships between the soil variables were then used to generate data using a Multiple Linear Perceptron (MLP) regressor for various levels of deposit depth (0, 5, 10, 15, 20, 25 and 30 cm). Then linear regression equations were fitted across the different levels of deposit depth to determine the effect of deposit depth on CaCO3, P, and Mn. The results show that there is a linear slope of 0.12, -0.16, and 0.13, for CaCO3, P, and Mn with deposit depth, respectively. Statistical analysis indicates that corn growing in soils with sediment over 10 cm requires a 31.8% increase in P rate to prevent yield decline. Additional notifications regarding cropping strategies in the near future are also discussed.

Human keratinocytes and melanoma can stick together to form clusters after eight days in co-culture. As in dynamic system concepts, one can consider cluster formation as the system attractor, cell seeding as the initial condition, and density change over time as a path within the basin of attraction. Herein, Cellular Automata, which is a class of Agent-Based Models, and Boolean Networks are discrete modeling methods used in population dynamics such that running the dynamics of cellular automata backward reveals an underlying network in terms of basin of attraction, also known as global dynamics. Thus, we hypothesize that one can estimate the local dynamic of an agent-based model from the basin of attraction of a boolean network. Here, we propose an approach to estimating these agent-based model rules, which consists of comparing the density states within each state transition and reaching a consensus among state transitions belonging to a basin of attraction of a boolean network. The objectives of this study are: (1) to infer a boolean network from the co-culture growth curve; (2) to estimate the rules of agent-based models; and (3) to implement spatial dynamics simulations. The binarization of the growth curve shows high population density after four days; the estimated agent-based model rules were compatible with cell proliferation and migration in agreement with literature, so we had to propose individual rules for survival and death. Spatial dynamics shows that (1) keratinocytes exhibit a higher density in neighborhoods where melanoma is present; (2) the chance of keratinocyte migration increases until the fourth day, then decreases, and the probability of survival increases substantially after four days; and (3) cells with low proliferation capacity die and free space for those with high ones. Our approach suggests that the attractor state of cell co-culture is induced mainly by an increase in keratinocyte migration and survival. Our approach has the potential to offer valuable clues about microenvironmental interactions or configurations that drive population dynamics.

Emotion recognition and social inference impairments are well-documented post-traumatic brain injury (TBI) yet the mechanisms underpinning these are not fully understood. We examined dynamic emotion recognition, social inference abilities, and eye fixation patterns between adults with and without TBI. Eighteen individuals with TBI and 18 matched non-TBI participants were recruited and underwent all three components of The Assessment of Social Inference Test (TASIT). The TBI group were less accurate in identifying emotions compared to the non-TBI group. Individuals with TBI also scored lower when distinguishing sincere and sarcastic conversations but scored similarly to those without TBI during lie vignettes. Finally, those with TBI also had difficulty understanding the actor’s intentions, feelings, and beliefs compared to participants without TBI. No group differences were found for eye fixation patterns and there were no associations between fixations and behavioural accuracy scores. This conflicts with previous studies and might be related to an important distinction between static and dynamic stimuli. Visual strategies appeared goal- and stimulus-driven, with attention being distributed to the most diagnostic area of the face for each emotion. These findings suggest that low-level visual deficits may not be modulating emotion recognition and social inference disturbances post-TBI.

Using a simple model for internal heat evolution and mass-internal heat relations found for rocky exo planetary objects in the inner solar system we have inferred the phases of volcanism at earth ( EA) or host star ages (SA) in 52 potentially habitable rocky exo planets. We have also calculated the internal tidal heat contributions and magnetic moments of these exo planets. Based on these results we have inferred the probability of existence of life favouring geophysical conditions in the above exo planets at EA and SA. In M star associated exo planets, occurrences of super flares and long night periods may pose problems for the development of advanced life

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 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.

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.

Large language models (LLMs) are known for their exceptional performance across a range of natural language processing tasks, but their deployment comes at a high computational and financial cost. On the other hand, smaller language models (SLMs), which can be deployed on lower-cost edge devices, struggle to match the performance of their larger counterparts. This paper presents a novel hybrid inference approach that leverages the strengths of both model types while minimizing reliance on costly cloud-based LLMs. Unlike existing methods that route entire queries to either an SLM or a cloud LLM, our approach introduces a reward-based mechanism to dynamically determine the involvement of the cloud LLM during token generation. Specifically, each token predicted by the SLM is evaluated against a reward score, and only when this score falls below a certain threshold is the cloud LLM consulted for assistance in the next token prediction. This method not only reduces the traffic to the cloud LLM, thereby lowering costs, but also allows for flexible control over response quality depending on the reward score threshold. Experimental results demonstrate that our approach significantly reduces cloud LLM usage with minimal impact on overall response quality, offering a cost-effective solution for deploying high-performance language models.

Unhealthy concentrations of ozone in the Uinta Basin, Utah, can occur after sufficient snowfall and a strong atmospheric anticyclone creates a persistent cold pool that traps atmospheric ozone and its precursors emitted from oil and gas operations. The winter-ozone system has two clear outcomes—occurrence or not—that is well understood by domain experts and supported by archives of atmospheric observations. Rules of the system can be formulated in natural language (“sufficient snowfall and high pressure leads to high ozone"), lending itself to analysis with a fuzzy-logic inference system. This method encodes human expertise as machine intelligence in a more constrained manner than alternative, more complex inference methods such as neural networks, increasing user trustworthiness of our model prototype before further optimization. Herein, we develop an ozone-forecasting system, Clyfar, based on knowledge of system dynamics and informed by an archive of meteorological conditions and ozone concentration. The inference system demonstrates proof-of-concept despite rudimentary tuning. We describe our framework for predicting future ozone concentrations if input values are drawn from numerical weather prediction forecasts as a proxy for observations as the system’s initial conditions. Our model is computationally cheap, allowing us to sample uncertainty with substantially more ensemble members than in traditional NWP. We evaluate hindcasts for one winter, finding our prototype demonstrates promise to deliver useful guidance for users concurrent with optimization of system parameters using machine learning.

The present study is to address performance of the dairy supply chain and emphasizes the significance of reliability of the chain as a fundamental and critical attribute for fulfilling the safety requirements. In order to evaluate the performance of the dairy supply chain, the present study utilizes the reliability attribute, which is an essential and informative system performance indicator. The study considers not only the inputs and outputs but also internal activities and relationships between customers, manufacturers, and suppliers. To minimize calculations and resolve uncertainties and vagueness that may be experienced in the performance evaluation process, this study proposes the use of the Fuzzy Inference System (FIS) approach and evaluates the reliability at each level of the supply chain: supply, manufacturing, and distribution. Combining the reliability of different levels, the study finally calculates the reliability of the entire supply chain. The proposed methodology offers a practical approach for evaluating the reliability performance of a dairy supply chain and can be easily extended to other industries as well. To verify the proposed methodology, a real case in the Iranian dairy industry is chosen to be studied. Results indicate that the proposed methodology can effectively identify bottlenecks or weaknesses in the dairy supply chain and help develop effective strategies to address them. Analyzing factors influencing supply chain reliability can optimize operations, reduce costs, and improve the overall quality of dairy product quality delivered to consumers.

Self-esteem, the evaluation of one's own worth or value, is a critical aspect of psychological well-being and mental health. In this paper, we propose an active inference account of self-esteem, casting it as a sociometer, or an inferential capacity to interpret one's standing within a social group. This approach allows us to explore the interaction between an individual's self-perception and the expectations of their social environment.When there's a mismatch between these perceptions and expectations, the individual needs to adjust their actions or update their self-perception to better align with their current experiences. We also consider this hypothesis in relation to recent research on affective inference, suggesting that self-esteem enables the individual to track and respond to this discrepancy through affective states such as anxiety or positive affect. By acting as an inferential sociometer, self-esteem allows individuals to navigate and adapt to their social environment, ultimately impacting their psychological well-being and mental health.

Deploying UAVs as aerial base stations is an exceptional approach to reinforce terrestrial infrastructure owing to their remarkable flexibility and superior agility. However, it is essential to design their flight trajectory effectively to make the most of UAV-assisted wireless communications. This paper presents a novel method for improving wireless connectivity between UAVs and terrestrial users through effective path planning. This is achieved by developing a goal-directed trajectory planning method using active inference. First, we create a global dictionary using TSPWP instances executed on various training examples. This dictionary contains letters representing available hotspots, tokens representing local paths, and words depicting complete trajectories and hotspot order. By using this world model, the UAV can understand the TSPWP’s decision-making grammar and how to use the available letters to form tokens and words at various levels of abstraction and time scales. With this knowledge, the UAV can assess encountered situations and deduce optimal routes based on the belief encoded in the world model. Our proposed method outperforms traditional Q-learning by providing fast, stable, and reliable solutions with good generalization ability.

The success of a software product depends on several factors. Given that different organizations and institutions use software products, the need to have a quality and desirable software according to the goals and needs of the organization makes measuring the quality of software products an important issue for most organizations and institutions. To be sure of having the right software. It is necessary to use a standard quality model to examine the features and sub-features for a detailed and principled study in the quality discussion. In this study, the quality of Word software was measured. Considering the importance of software quality and to have a good and usable software in terms of quality and measuring the quality of software during the study, experts and skilled in this field were used and the impact of each factor and quality characteristics. It was applied at different levels according to their opinion to make the result of measuring the quality of Word software more accurate and closer to reality. In this research, the quality of the software product is measured based on the fuzzy inference system in ISO standard. According to the results obtained in this study, it is understood that quality is a continuous and hierarchical concept and the quality of each part of the software at any stage of production can lead to high quality products.

Most existing flexible count regression models allow only approximate inference. Balanced discretization is a simple method to produce a mean-parametrizable flexible count distribution starting from a continuous probability distribution. This makes easy the definition of flexible count regression models allowing exact inference under various types of dispersion (equi-, under- and overdispersion). This study describes maximum likelihood (ML) estimation and inference in count regression based on balanced discrete gamma (BDG) distribution and introduces a likelihood ratio based latent equidispersion (LE) test to identify the parsimonious dispersion model for a particular dataset. A series of Monte Carlo experiments were carried out to assess the performance of ML estimates and the LE test in the BDG regression model, as compared to the popular Conway-Maxwell-Poisson model (CMP). The results show that the two evaluated models recover population effects even under misspecification of dispersion related covariates, with coverage rates of asymptotic 95% confidence interval approaching the nominal level as the sample size increases. The BDG regression approach, nevertheless, outperforms CMP regression in very small samples (n = 15 − 30), mostly in overdispersed data. The LE test proves appropriate to detect latent equidispersion, with rejection rates converging to the nominal level as the sample size increases. Two applications on real data are given to illustrate the use of the proposed approach to count regression analysis.

Demographic processes directly affect patterns of genetic variation within contemporary populations as well as future generations, allowing for demographic inference from patterns of both present day and past genetic variation. Advances in laboratory procedures and sequencing and genotyping technologies in the last decades have resulted in massive increases in high quality genome-wide genetic data from present day populations and allowed retrieving genetic data from archaeological material, also known as ancient DNA. This has resulted in an explosion of work exploring past changes in population size, structure, continuity and movement. However, as genetic processes are highly stochastic, patterns of genetic variation only indirectly reflect demographic histories. As a result, past demographic processes need to be reconstructed using an inferential approach. This usually involves comparing observed patterns of variation with model expectations from theoretical population genetics. A large number of approaches have been developed based on different population genetic models that each come with assumptions about the data and underlying demography. In this article I review some of the key models and assumptions underlying the most commonly used approaches for past demographic inference and their consequences for our ability to link the inferred demographic processes to the archaeological and climate records.

In this effort we propose a data-driven learning framework for reduced order modeling of fluid dynamics. Designing accurate and efficient reduced order models for nonlinear fluid dynamic problems is challenging for many practical engineering applications. Classical projection-based model reduction methods generate reduced systems by projecting full-order differential operators into low-dimensional subspaces. However, these techniques usually lead to severe instabilities in the presence of highly nonlinear dynamics, which dramatically deteriorates the accuracy of the reduced-order models. In contrast, our new framework exploits linear multistep networks, based on implicit Adams-Moulton schemes, to construct the reduced system. The advantage is that the method optimally approximates the full order model in the low-dimensional space with a given supervised learning task. Moreover, our approach is non-intrusive, such that it can be applied to other complex nonlinear dynamical systems with sophisticated legacy codes. We demonstrate the performance of our method through the numerical simulation of a two-dimensional flow past a circular cylinder with Reynolds number Re = 100. The results reveal that the new data-driven model is significantly more accurate than standard projection-based approaches

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.

This article has two objectives. Firstly, we will use the vector variational-like inequalities problems to achieve local approximate (weakly) efficient solutions of Vector Optimization Problem within the novel field of the Hadamard manifolds. Previously, we will introduce the concepts of generalized approximate geodesic convex functions and illustrate them with examples. We will see the minimum requirements under which critical points, solutions of Stampacchia and Minty weak variational-like inequalities and local approximate weakly efficient solutions can be identified, extending previous results from the literature for linear Euclidean spaces. Secondly, we will show an economical application, using again solutions of the variational problems to identify with Stackelberg equilibrium points on Hadamard manifolds and under geodesic convexity assumptions.

Three Dimensional Variational data assimilation or analysis (3DVAR) is one of most classical methods for providing the initial values for numerical models. In this method, the dimensions of the background error covariance and the observational error covariance matrices are large. Therefore, it is difficult to get the inverse of the covariance matrices and to reduce the orders of these matrices without information loss. With the use of the Sylvester Equation, on the basis of a new linear regression, a new cost function for 3DVAR was given. For the first-guess m×n field, there is an approximate 1−(m²+n²)/(mn×mn) reduction with m>1 & n>1 by using the cost function. The results of the numerical experiments show that the effect of this algorithm is no worse than that of the old cost function for 3DVAR.

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.

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.

Deep Neural Network (DNN) inference demands substantial computing power, resulting in significant energy consumption. A large number of negative output activations in convolution layers are rendered zero due to the invocation of the ReLU activation function. This results in a substantial number of unnecessary computations that consume significant amounts of energy. This paper presents ECHO: Energy-efficient Computation Harnessing Onilne Arithmetic - A MSDF-based accelerator for DNN inference, designed for computation pruning, utilizing an unconventional arithmetic paradigm known as online/ most-significant digit first (MSDF) arithmetic which performs computations in a digit-serial manner. The MSDF digital serial computation of online arithmetic enables overlapped computation of successive operations leading to substantial performance improvements. The online arithmetic, coupled with a negative output detection scheme, facilitates early and precise recognition of negative outputs. This, in turn, allows for the timely termination of unnecessary computations, resulting in a reduction of energy consumption. The implemented design has been realized on the Xilinx Virtex-7 VU3P FPGA and subjected to a comprehensive evaluation through a rigorous comparative analysis involving widely used performance metrics. Experimental results demonstrate promising power and throughput improvements compared to contemporary methods. In particular, the proposed design achieved an average improvement in power consumption of up to 81%, 82.9%, and 40.6% for VGG-16, ResNet-18, and ResNet-50 workloads compared to the conventional bit-serial design, respectively. Furthermore, significant average speedups of 2.39×, 2.6×, and 2.42 were observed when comparing the proposed design to conventional bit-serial designs for VGG-16, ResNet-18, and ResNet-50 models respectively.

Equipping autonomous agents for dynamic interaction and navigation is a significant challenge in intelligent transportation systems. This study aims to address this by implementing a brain-inspired model for decision-making in autonomous vehicles. We employ active inference, a Bayesian approach that models decision-making processes similar to the human brain, focusing on the agent's preferences and the principle of free energy. This approach is combined with imitation learning to enhance the vehicle's ability to adapt to new observations and make human-like decisions. The research involved developing a multi-modal self-awareness architecture for autonomous driving systems and testing this model in driving scenarios, including abnormal observations. The results demonstrated the model's effectiveness in enabling the vehicle to make safe decisions, particularly in unobserved or dynamic environments. The study concludes that the integration of active inference with imitation learning significantly improves the performance of autonomous vehicles, offering a promising direction for future developments in intelligent transportation systems.

For Convolutional Neural Network (CNN), Depthwise Separable CNN (DSCNN) is a preferred architecture for Application Specific Integrated Circuit (ASIC) implementation on edge devices. It can benefit from a multi-mode approximate multiplier proposed in this work. The proposed approximate multiplier uses two 4-bit multiplication operations to implement a 12-bit multiplication operation by reusing the same multiplier array. With this approximate multiplier, sequential multiplication operations are pipelined in a modified DSCNN to fully utilize the PE array in the convolutional layer. This Approximate (A-DSCNN) was implemented on TSMC 40-nm CMOS process with a supply voltage of 0.9 V. At the clock frequency of 200 MHz, the design achieves 4.78 GOPs/mW while occupying 1.24 mm x 1.24 mm silicon area. Compared to conventional DSCNN implemented in a similar process node, the chip area and power consumption were reduced by 53% and 25%, while the throughput was improved by 17%.

The giant challenge breeding flood-irrigated rice is to identify superior genotypes that present high-yielding with specific grain qualities, resistance to abiotic and biotic stresses, excellent adaptation to the target environment. Thus, the objectives of this study were to propose a bayesian multi-trait model, estimate genetic parameters, and select flood-irrigated rice genotypes with better genetic potentials in different evaluation environments. For this, twenty-five rice genotypes belonging to the flood-irrigated rice improvement program were evaluated. The grain yields, grain length, width and thickness, grain length, and grain width and weight of 100 grains in the agricultural year 2016/2017. The experimental design used in all experiments was a randomized block design with three replications. The Monte Carlo Markov Chain algorithm estimated genetic parameters and genetic values. The grain thickness trait was considered highly heritable, with a credibility interval ranging from: h^2: 0.9480; 0.9440; 0.8610, in environments 1, 2, and 3, respectively. The grain yields showed a low correlation estimate between grain thickness and 100-grain weight, in all environments, with a credibility interval ranging from (ρ= 0.5477; 0.5762; 0.5618 and 0.5973; 0.5247; 0.5632, grain thickness and 100-grain weight, in environments 1, 2, and 3, respectively). The Bayesian multi-trait model proved to be an adequate strategy for the genetic improvement of flood-irrigated. Genotypes 2 and 15 had similar potential in the three environments, they should be selected as high-performance multi-trait genotypes for the genetic breeding of flood-irrigated rice in the program.