A complete MAPLE procedure is designed to implement effectively an algorithm for approximating the trigonometric functions. The algorithm gives a piecewise polynomial approximation on an arbitrary interval, presenting a special partition that we can get its parts, subintervals with ending points of finite rational numbers, together with corresponding approximate polynomials. The procedure takes a sequence of pairs of interval-polynomial as its output that we can easily explore in some useful ways. Examples on calculating approximate values of the sine function with arbitrary accuracy for both of rational and irrational arguments as well as drawing the graph of the piecewise approximate functions will be presented. Moreover, from the approximate integration of integrands of the form $x^m\sin x$ on $[a,b]$, another MAPLE procedure is proposed to find the desired polynomial estimates in norm for the best $L^2$-approximation of the sine function in the vector space $\mathcal{P}_{\ell}$ of polynomials of degree at most $\ell$, a subspace of $L^2(a,b)$.

The $k$-means problem is to compute a set of $k$ centers (points) that minimizes the sum of squared distances to a given set of $n$ points in a metric space. Arguably, the most common algorithm to solve it is $k$-means++ which is easy to implement, and provides a provably small approximation factor in time that is linear in $n$. We generalize $k$-means++ to support: (i) non-metric spaces and any pseudo-distance function. In particular, it supports M-estimators functions that handle outliers, e.g. where the distance $\mathrm{dist}(p,x)$ between a pair of points is replaced by $\min {\mathrm{dist}(p,x),1}$. (ii) $k$-means clustering with $m\geq 1$ outliers, i.e., where the $m$ farthest points from the $k$ centers are excluded from the total sum of distances. This is the first algorithm whose running time is linear in $n$ and polynomial in $k$ and $m$.

In this paper, we propose a new covering-based set in which the lower and the upper approximation operations are defined by neighborhood systems. We discuss this new type of covering-based set systematically in two steps. First, we study the basic properties of this covering-based set, such as the properties of normality, contraction, and monotone. Second, we discuss the relationship between the new type of covering-based set and the other ten sets proposed.

In this paper, we propose a new covering-based set in which the lower and the upper approximation operation are defined by neighborhood systems. We discuss this new type of covering-based set systematically in two steps. First, we study the basic properties of this covering-based set, such as the properties of normality, contraction, and monotone. Second, we discuss the relationship between the new type of covering-based set and the other ten sets proposed.

To determine the photon emission or absorption probability for a diatomic system in the context of the semiclassical approximation it is necessary to calculate the characteristic canonical oscillatory integral which has one or more saddle points. Integrals like that appear in a whole range of physical problems, e.g. the atom-atom and atom-surface scattering and various optical phenomena. A uniform approximation of the integral, based on the stationary phase method is proposed, where the integral with several saddle points is replaced by a sum of integrals each having only one or at most two real saddle points and is easily soluble. In this way we formally reduce the codimension in canonical integrals of "elementary catastrophes" with codimensions greater than 1. The validity of the proposed method was tested on examples of integrals with three saddle points ("cusp" catastrophe) and four saddle points ("swallow-tail" catastrophe).

In this work, an innovative numerical approach for polylinear approximation (polylinearization) of non-self-intersecting compact sensor characteristics (transfer functions) specified either pointwise or analytically is introduced. The goal is to optimally partition the sensor characteristic, i.e. to select the vertices of the approximating polyline (approximant) along with their positions on, the sensor characteristics so that the distance (i.e. the separation) between the approximant and the characteristic is rendered below a certain problem-specific tolerance. To achieve this goal, two alternative non-linear optimization problems are solved, whose essential difference is in the adopted quantitative measure of the separation between the transfer function and the approximant. In the first problem, which relates to absolutely integrable sensor characteristics (their energy is not necessarily finite, but they can be represented in terms of convergent Fourier series), the polylinearization is constructed by numerical minimization of the L^1--metric (a distance-based separation measure), concerning the number of polyline vertices and their locations. In the second problem which covers the quadratically integrable sensor characteristics (whose energy is finite, but they do not necessarily admit a representation in terms of convergent Fourier series), the polylinearization is constructed by minimizing numerically the L^2-metric (area-, or energy-based separation measure) for the same set of optimization variables –the locations, and the number of polyline vertices.

In this review paper, we present a pellucid proof of how x tanh(x/µ) approximates |x|and is better than √x² +µ  when we are concernedwith accuracy.

The effect of thermal radiation on the two – dimensional, steady-state, conjugate heat transfer from a circular cylinder with an internal heat source in steady laminar crossflow is investigated in this work. P₀ (Rosseland) and P₁ approximations were used to model the radiative transfer. The mathematical model equations were solved numerically. Qualitatively, P₀ and P₁ approximations show the same effect of thermal radiation on conjugate heat transfer; the increase in the radiation – conduction parameter decreases the cylinder surface temperature and increases the heat transfer rate. Quantitatively, there are significant differences between the results provided by the two approximations.

In this paper we consider constructions of first derivative approximations using the generating function. The weights of the approximations contain the powers of a parameter whose modulus is less than one. The values of the initial weights are determined, and the convergence and order of the approximations are proved. The paper discusses applications of approximations of first derivative for numerical solution of ordinary and partial differential equations and proposes an algorithm for fast computation of the numerical solution. Proofs of the convergence and accuracy of the numerical solutions are presented and the performance of the numerical methods considered is compared with the Euler method. The main goal of constructing approximations for integer-order derivatives of this type is their application in deriving high-order approximations for fractional derivatives, whose weights have specific properties. The paper proposes the construction of an approximation for the fractional derivative and its application for numerically solving fractional differential equations. The theoretical results for the accuracy and order of the numerical methods are confirmed by the experimental results presented in the paper.

Gaussian mixture models (GMMs) are powerful tools specifically suited for problems where data distributions are multi-modal. Inspired by Fourier expansion, we propose a concept called GMM expansion to approximate arbitrary densities. A simple learning method is introduced under this framework. Theoretical and numerical analyses are provided to show that densities under GMM expansion are able to approximate arbitrary densities with certain accuracy. The proposed learning algorithm demonstrates better accuracy and time efficiency compared to classic density approximation methods such as the Expectation Maximization (EM) algorithm and Bayesian variational inference (BVI) for Gaussian mixture models. The proposed framework also shows better accommodation of neural networks. Three neural network applications are built to demonstrate its usability. The accuracy of density estimation in neural networks is reported to be significantly improved in one of the applications. Another application shows that latent variables can be easily turned into random variables. This user-friendly method opens up more possibilities in terms of latent manipulation, embedding techniques, and many other potential uses.

The fractional derivatives are a generalization the derivatives of integer order and find applications in studying memory processes in various scientific fields. Numerical methods are used to solve and analyze fractional models of real world problems. In this paper, we consider an approximation of the Caputo fractional derivative and its asymptotic formula, whose generating function is the polylogarithmic function. In the paper, we prove the convergence of the approximation and derive an estimate for the error and order. We consider an application of the approximation for the construction of finite difference schemes for numerical solution of the two-term ordinary fractional differential equation and the time-fractional Black-Scholes equation for option pricing. The properties of the approximation are used to prove the convergence of the methods used for numerical solution of the fractional differential equations. The theoretical results for the error and order of the methods are illustrated by the results of numerical experiments.

In transient phase of an atmospheric-pressure discharge, the avalanche turns into a streamer discharge with time. Hydrodynamic fluid models are frequently used to describe the formation and propagation of streamers, where charge particle transport is dominated by the creation of space charge. The required electron transport data and rate coefficients for the fluid model are parameterized using the local mean-energy approximation (LMEA) and the local field approximation (LFA). In atmospheric pressure applications, the excited species produced in the electrical discharge determine the subsequent conversion chemistry. We performed the fluid model simulation of streamers in nitrogen gas at atmospheric pressure using three different parametrizations for transport and electron excitation rate data. We present the spatial and temporal development of several macroscopic properties such as electron density and energy, and the electric field during the transient phase. The species production efficiency which is important to understand the efficacy of any application of non-thermal plasmas is also obtained for the three different parametrizations. Our results suggest that at atmospheric pressure all three schemes predicted essentially the same macroscopic properties. Therefore, a lower order method such as LFA which does not require the solution of the energy conservation equation should be adequate to determine the streamer macroscopic properties to inform most plasma-assisted applications of nitrogen containing gases at atmospheric pressure.

In this work, we consider the properties of the two-term Machin-like formula and develop an algorithm for computing digits of π by using its rational approximation. In this approximation, both terms are constructed by using a representation of 1/π in the binary form. This approach provides the squared convergence in computing digits of π without any trigonometric functions and surd numbers. The Mathematica codes showing some examples are presented.

The obtention of simple formulae for the Lebesgue constants arising in the the classical Fourier series approximation is presented. Both even and odd cases are treated enlarging Fejér result. Asymptotic formulae are also obtained.

The well-known equations for the process of powder compaction (PCP) in a rigid die published over the period from the beginning of the last century to the present are considered. Most of the considered equations are converted into the dependence of the densification pressure on the relative density. The equations were analyzed and their ability to describe PCP was assessed by determining the coefficient of determination when approximating experimental data on the compaction of various powders. It is shown that most of the equations contain two constants, the values of which are determined by fitting the mathematical dependence to the experimental curve. Such equations are able to describe PCP with high accuracy in the case of compaction of powders up to a relative density of 0.9-0.95. It is also shown that different equations can describe PCP in the range of density change from the initial to 0.9 with the same and sufficiently high accuracy, but when the process of compaction is extrapolated to higher values of density, the curves diverge. This indicates the importance of equations that can unambiguously describe PCP to a relative density equal to or close to 1.0. For an adequate description of PCP to a relative density greater than 0.95, equations containing three or four constants have proven themselves well.

Galaxies are rather big physical systems having a typical size of tens of kilo parsecs. Thus any change at the center of the galaxy will affect the outskirts only tens of thousand of years afterwards. Retardation seems to be neglected in current calculations of rotational velocities in the far edges of the galaxy and its surrounding gas. The differences between the velocities predicted by Newtonian theory and observational derivations are accommodated by either assuming "dark matter" or by introducing modifications to the laws of gravity in which MOdified Newtonian Dynamics (MOND) is one of the typical examples, celebrating now forty years since its inception. We show that there are overlapping conditions for retardation corrections in the weak approximation to general relativity and the low acceleration conditions for MOND corrections. We will also show that MOND interpolation formula is useful for calculating retardation effects provided an appropriate interpolation function is chosen.

This paper is given to the investigation of warm inflation using Modified Chaplygin gas in the background of locally rotationally symmetric Bianchi Identity type I. We find out the field equations and perturbations parameters such as; scalar power spectrum, scalar spectral index, scalar potential and tensor to scalar ratio under slow roll approximation. We find out these parameters in directional of Hubble parameter during the Logamediate inflationary regime in weak and strong case. These comological parameters shows that the anisotropic model is also compatible WMAP$7$ with recent observational data Planck $2018$.

The many-body problem in quantum physics originates from the difficulty of describing the non-trivial correlations encoded in the exponential complexity of the many-body wave function. Motivated by the Giuseppe Carleo's work titled solving the quantum many-body problem with artificial neural networks [Science, 2017, 355: 602], we focus on finding the NNQS approximation of the unknown ground state of a given Hamiltonian $H$ in terms of the best relative error and explore the influences of sum, tensor product, local unitary of Hamiltonians on the best relative error. Besides, we illustrate our method with some examples.

Log collection and storage is a crucial process for enterprises around the globe. Log analysis helps identify potential security breaches and, in some cases, is required by law for compliance. However, enterprises often delegate these responsibilities to third-party Cloud Service Providers (CSPs), where the logs are collected and processed for anomaly detection and stored in a data warehouse for archiving. Prevalent schemes rely on plain (unencrypted) data for anomaly detection. More often, these logs can reveal sensitive information about an organization or the customers of that organization. Hence, it is best to keep it encrypted at all times. This paper presents "SigML++," an extension of work done in "SigML." We utilize Fully Homomorphic Encryption (FHE) with the Cheon-Kim-Kim-Song (CKKS) scheme for supervised log anomaly detection on encrypted data. We use an Artificial Neural Network (ANN) based probabilistic polynomial approximations using a Perceptron with linear activation. We probabilistically approximate the Sigmoid activation function (σ(x)) in the encrypted domain for the intervals [−10,10] and [−50,50]. Experiments show better approximations for Logistic Regression (LR) and Support Vector Machine (SVM) for low-order polynomials.

In recent years, research on adversarial attack techniques for remote sensing object detection (RSOD) has made great progress. Still, most of the research nowadays is on end-to-end attacks, which mainly design adversarial perturbations based on the prediction information of the object detectors (ODs) to achieve the attack. These methods do not discover the common vulnerabilities of the ODs and thus the transferability is weak. Based on this, this paper proposes a foreground feature approximation (FFA) method to generate adversarial examples (AEs) that discover the common vulnerabilities of the ODs by changing the feature information carried by the image itself to implement the attack. Specifically, firstly, the high-quality predictions are filtered as attacked objects using the detector, after which a hybrid image without any target is made, and the hybrid foreground is created based on the attacked targets. The images' shallow features are extracted using the backbone network, and the features of the input foreground are approximated towards the hybrid foreground to implement the attack. In contrast, the model predictions are used to assist in realizing the attack. In addition, we have found the effectiveness of FFA for targeted attacks, and replacing the hybrid foreground with the targeted foreground can realize targeted attacks. Extensive experiments with seven rotating ODs on the RSOD datasets DOTA and UCAS-AOD show that FFA achieves both targetless and targeted attacks with a high success rate and transferability.

In this paper, the optimal approximation algorithm is proposed to simplify non-linear functions and/or discrete data as piecewise polynomials by using the constrained least squares. In time-sensitive applications or in embedded systems with limited resources, the runtime of the approximate function is as crucial as its accuracy. The proposed algorithm search to find the Optimal Piecewise Polynomial (OPP) with minimum computational cost while ensuring the error below a specified threshold. This was accomplished by using smooth piecewise polynomials with optimal order and number of intervals. The computational cost only depends on polynomial complexity, i.e., the order and the number of intervals at runtime function call. For optimal approximation, computational costs for all the possible combinations of piecewise polynomials were calculated and tabulated as ascending order for the specific target CPU off-line. Each combination was optimized through constrained least squares and random selection method for given sample points. Afterward, whether the approximation error is below the predetermined value is examined. When the error is permissible, the combination is selected as the optimal approximation or the next combination was examined. To verify the performance, several representative functions were examined and analyzed.

We study L_2-approximation problems in the weighted Hilbert spaces in the worst case setting. Three interesting weighted Hilbert spaces appear in this paper, whose weights are equipped with two positive parameters $\ga_j$ and $\az_j$ for $j=1,\,2,\dots,\,d$. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. We discuss the exponential convergence-(t,s)-weak tractability (EC-(t,s)-WT) of these L_2-approximation problems under the absolute or normalized error criterion. In particular, we obtain the sufficient and necessary conditions for EC-(1,1)-WT and EC-(t,1)-WT with t

We investigate \texorpdfstring{$L_2$}{}-approximation problems in the worst case setting in the weighted Hilbert spaces \texorpdfstring{$H(K_{R_{d,\a,\g}})$}{} with weights \texorpdfstring{$R_{d,\a,{\bm \ga}}$}{} under parameters \texorpdfstring{$1\ge \ga_1\ge \ga_2\ge \cdots\ge 0$ and $1<\az_1\le \az_2\le \cdots$}{}. Several interesting weighted Hilbert spaces \texorpdfstring{$H(K_{R_{d,\a,\g}})$}{} appear in this paper. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. Multivariate approximation; information complexity; tractability; weighted Hilbert spacesWe discuss tractability of \texorpdfstring{$L_2$}{}-approximation problems for the involved Hilbert spaces, which describes how the information complexity depends on \texorpdfstring{$d$}{} and \texorpdfstring{$\va^{-1}$}{}. As a consequence we study the strongly polynomial tractability (SPT), polynomial tractability (PT), weak tractability (WT), and \texorpdfstring{$(t_1,t_2)$}{}-weak tractability (\texorpdfstring{$(t_1,t_2)$}{}-WT) for all \texorpdfstring{$t_1>1$}{} and \texorpdfstring{$t_2>0$}{} in terms of the introduced weights under the absolute error criterion or the normalized error criterion.

This paper presents a non-perturbative method for solving eigenproblems. This method applies to almost all potentials and provides non-perturbative approximations for any energy level. The method converts an eigenproblem into a perturbation problem, obtains perturbation solutions through standard perturbation theory, and then analytically continues the perturbative solution into a non-perturbative solution.

An approach to estimating the objective function value of minimization maximum lateness problem is proposed. It is shown how to use transformed instances to define a new continuous objective function. After that, using this new objective function, the approach itself is formulated. We calculate the objective function value for some polynomially solvable transformed instances and use them as interpolation nodes to estimate the objective function of the initial instance. What is more, two new polynomial cases, that are easy to use in the approach, are proposed. In the end of the paper numeric experiments are described and their results are provided.

This paper extends the Stochastic Method of Cuts (SMoC) to approximate of the Macroscopic Fundamental Diagram (MFD) of urban networks and uses Maximum Likelihood Estimation (MLE) method to estimate the model parameters based on empirical data from a corridor and 30 cities around the world. For the corridor case, the estimated values are in good agreement with the measured values of the parameters. For the network datasets, the results indicate that the method yields satisfactory parameter estimates and graphical fits for roughly 50\% of the studied networks, where estimations fall within the expected range of the parameter values. The satisfactory estimates are mostly for the datasets which (i) cover a relatively wider range of densities and (ii) the average flow values at different densities are approximately normally distributed similar to the probability density function of the SMoC. The estimated parameter values are compared to the real or expected values and any discrepancies and their potential causes are discussed in depth to identify the challenges in the MFD estimation both analytically and empirically. In particular, we find that the most important issues needing further investigation are: (i) the distribution of loop detectors within the links, (ii) the distribution of loop detectors across the network, and (iii) the treatment of unsignalized intersections and their impact on the block length.

We calculate the spectral function of a boson ladder in an artificial magnetic field by means of analytic approaches based on bosonization and Bogoliubov theory. We discuss the evolution of the spectral function at increasing effective magnetic flux, from the Meissner to the Vortex phase, focussing on the effects of incommensurations in momentum space. At low flux, in the Meissner phase, the spectral function displays both a gapless branch and a gapped one, while at higher flux, in the Vortex phase, the spectral function displays two gapless branches and the spectral weight is shifted at a wavevector associated to the underlying vortex spatial structure which can indicate a 8 supersolid-like behavior. While the Bogoliubov theory, valid at weak interactions, predicts sharp delta-like features in the spectral function, at stronger interactions we find power-law broadening of 10 the spectral functions due to quantum fluctuations as well as additional spectral weight at higher 11 momenta due to backscattering and incommensuration effects. These features could be accessed in 12 ultracold atom experiments using radio-frequency spectroscopy techniques.

We present smooth approximations to $ \vert{x} \vert $ using sigmoid functions. In particular $ x\,erf(x/\mu) $ is proved to be better smooth approximation for $ \vert{x} \vert $ than $ x\,tanh(x/\mu) $ and $ \sqrt{x^2 + \mu} $ with respect to accuracy. To accomplish our goal we also provide sharp hyperbolic bounds for error function.

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

In this paper, we present a general version of polygonal fitting problem called Unconstrained Polygonal Fitting (UPF). Our goal is to represent a given 2D shape S with an N-vertex polygonal curve P with a known number of vertices, so that the Intersection over Union (IoU) metric between S and P is maximized without any assumption or prior knowledge of the object structure and the location of the N-vertices of P that can be placed anywhere in the 2D space. The search space of the UPF problem is a superset of the classical polygonal approximation (PA) problem, where the vertices are constrained to belong in the boundary of the given 2D shape. Therefore, the resulting solutions of the UPF may better approximate the given curve than the solutions of the PA problem. For a given number of vertices N, a Particle Swarm Optimization (PSO) method is used to maximize the IoU metric, which yields almost optimal solutions. Furthermore, the proposed method has also been implemented under the equal area principle so that the total area covered by P is equal to the area of the original 2D shape to measure how this constraint affects IoU metric. The quantitative results obtained on more than 2,800 2D shapes included in two standard datasets quantify the performance of the proposed methods and illustrate that their solutions outperform baselines from the literature.

In this paper, we have constructed a WKB approximation for graphene having a Y-shaped Kekul\'e lattice distortion and a special folding of the $\mbox{\boldmath$K$}$ and $\mbox{\boldmath$K$}^\prime$ valleys, which leads to very specific linear energy dispersions with two non-equivalent pairs of subbands. These obtained semi-classical results, which include the action, electron momentum and wave functions, are utilized to analyze the dynamics of electron tunneling through non-square potential barriers. In particular, we explore resonant scattering of an electron by a potential barrier built on Kekul\'e-distorted graphene. Mathematically, a group of consecutive equations for a semi-classical action have been solved by following a perturbation approach under the condition of small strain-induced coupling parameter $\Delta_0 \ll 1$ (a good fit to its actual value $\Delta_0 \backsim 0.1$). Specifically, we consider a generalized model for Kek-Y graphene with two arbitrary Fermi velocities. The dependence of the electron transmission amplitude on the potential profile $V(x)$ and band parameters of Kekul\'e-patterned graphene has been explored and analyzed in details.

This paper presents a new method for approximating the classical arcsine function. The proposed approximating methodology is simpler in its approach than other classical approaches and undeniably innovative. It is based on matrix representation besides the basic interpolation to approximate the inverse trigonometric function. It provides an efficient model which allows for reliable and precise calculations. The results are as per our knowledge unseen results in the previous literature.

This paper reports applying Minimax principle and impulsive differential inequality to derive the existence of multiple stationary solutions and the global stability of a positive stationary solution for a delayed feedback Gilpin-Ayala competition model with impulsive disturbance. The conclusion obtained in this paper reduces the conservatism of the algorithm compared with the known literature, for the impulsive disturbance is not limited to impulsive control.

With the revolution of computing and biology technology, data sets containing information could be huge and complex that sometimes are difficult to handle. Dynamic computing is an efficient approach to solve some of the problems. Since neighborhood multigranulation rough sets(NMGRS) were proposed, few papers focused on how to calculate approximations in NMGRS and how to update them dynamically. Here we propose approaches for computing approximations in NMGRS and updating them dynamically. First, static approaches for computing approximations in NMGRS are proposed. Second, search region in data set for updating approximations in NMGRS is shrunk. Third, matrix-based approaches for updating approximations in NMGRS while decreasing or increasing neighborhood classes are proposed. Fourth, incremental algorithms for updating approximations in NMGRS while decreasing or increasing neighborhood classes are designed. Finally, the efficiency and validity of the designed algorithms are verified by experiments.

Nonlinear nonparametric statistics (NNS) algorithm offers new tools for curve fitting. A relationship between k-means clustering and NNS regression points is explored with graphics showing a perfect fit in the limit. The goal of this paper is to demonstrate NNS as a form of unsupervised learning, and supply a proof of its limit condition. The procedural similarity NNS shares with vector quantization is also documented, along with identical outputs for NNS and a k nearest neighbours classification algorithm under a specific NNS setting. Fisher's iris data and artificial data are used. Even though a perfect fit should obviously be reserved for instances of high signal to noise ratios, NNS permits greater flexibility by offering a large spectrum of possible fits from linear to perfect.

In fuzzy group decision making problems and fuzzy shortest path problems, the addition and subtraction are the basic problems. For the mixed normal fuzzy numbers and trapezoidal fuzzy numbers, the addition and subtraction operations are approximated by the normal fuzzy numbers in this paper. The behaviors of approximated normal fuzzy numbers are the same as those of the normal distributions from the viewpoint of probability. An application of the addition and subtraction operations of mixed fuzzy numbers to the fuzzy sample mean is also proposed.

This paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the Peak Demand Minimization problem and has been previously shown to be NP-hard. Our results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.

One of the efficient data mining tools is density-based clustering, including the density grid-based clustering. However, a common drawback always existing in clusters made by the density grid-based method is the existence of weakly connected grids deriving mainly from noise. Appearing such an unwanted connection with a high frequency reduces the accuracy of the obtained cluster data space (CDS) and its application efficiency. Here, we present an essential improvement to overcome this problem. First, we describe a concept of the weak-connected grid cell (WCG) and present a fuzzy-type approximation to depict the density-based distribution of data points at grid nodes. Then, we propose a strategy of searching WCG for density grid-based clustering (SWCG-DGB) to set up a CDS, filter noise, and tune the created CDS. A buffer is deployed during this phase to collect border points and filter noise, which improves the computational time significantly, especially for noisy datasets. Results from numerical surveys reflected the compared efficiency of this method in clustering validity, including the accuracy of the number of clusters.

Being able to express broad families of equivariant or invariant attributed graph functions is a popular measuring stick of whether graph neural networks should be employed in practical applications. However, it is equally important to learn deep local minima of losses (i.e., with much smaller loss values than other minima), even when architectures cannot express global minima. In this work we introduce the architectural property of attracting GNN optimization trajectories to local minima as a means of achieving smaller losses. We take first steps in satisfying this property for losses defined over attributed undirected unweighted graphs with a novel architecture, called Universal Local Attractor (ULA). The latter refines each dimension of end-to-end trained node feature embeddings based on graph structure to track the optimization trajectories of losses satisfying some mild conditions. The refined dimensions are then linearly pooled to create predictions. We experiment on 10 tasks, from node classification to clique detection, on which ULA is comparable with or significantly outperforms popular alternatives of similar or greater theoretical expressive power.

Given a fuzzy normed space $ \left( X,N \right) $‎, ‎we will introduce the notion of fuzzy near best approximation within a relative distance $ \rho \geq 0 $‎. ‎Some basic properties are characterized and also many examples for illustration are presented‎.

River renaturation can be an effective management method for restoring the floodplain's natural capacity and minimizing the effects during high flow periods. A 1D-2D HEC-RAS model, in which the flood plain was considered as 2D and the main channel as 1D, was used to simulate flooding in the restored reach of the Spree River. When computing in this model, finite volume and finite difference approximations using the Preissmann approach are used for the 1D and 2D models, respectively. To comprehend the sensitivity of the parameters and model, several scenarios were simulated using different time steps and grid sizes. Additionally, dykes, dredging, and changes to the vegetation pattern have been used to simulate flood mitigation measures. The model predicted that flooding would occur mostly in the downstream portion of the channel in the majority of the scenarios without mitigation measures, whereas with mitigation measures, flooding in the floodplain would be greatly reduced. By preserving the natural balance on the channel's floodplain, the restored area needs to be kept in good condition. Therefore, mitigating measures that balance the area's economic and environmental aspects must be considered in light of the potential for floods.

The temporal evolution of pandemics described by the susceptible-infectious-recovered (SIR)-compartment model is sensitively determined by the time dependence of the infection (a(t)) and recovery (u(t)) rates regulating the transitions from the susceptible to the infected and from the infected to the recovered compartment, respectively. Here approximated SIR-solutions for different time dependencies of the infection and recovery rates are derived which are based on the adiabatic approximation assuming time-dependent ratios k(t)=u(t)/a(t) varying slowly in comparison to the typical time characteristics of the pandemic wave. For such slow variations the available analytical approximations from the KSSIR-model, valid for a stationary value of the ratio k, are used to insert a-posteriori the adopted time-dependent ratio of the two rates. Instead of investigating endless different combinations of the time dependencies of the two rates a(t) and u(t) a suitably parameterized reduced time dependence of the ratio k(tau) is adopted. Together with the definition of the reduced time this parameterized ratio k(tau) allows us to cover a great variety of different time dependencies of the infection and recovery rates. The agreement between the solutions from the adiabatic approximation in its four different studied variants and the exact numerical solutions of the SIR-equations is remarkably good providing strong confidence in the accuracy of the proposed adiabatic approximation.

This study focuses on the decisions of picking, inventory, ripening, delivering, and selling mangoes in a harvesting season. Demand, supply, and prices are uncertain, and their probability density functions are fitted based on actual trading data collected from the largest spot market in Taiwan. A stochastic programming model is formulated to minimize the expected cost under the considerations of labor, storage space, shelf life, and transportation restrictions. We implement the sample-average approximation to obtain a high-quality solution of the stochastic program. The analysis compares deterministic and stochastic solutions to assess the uncertain effect on the harvest decisions. Finally, the optimal harvest schedule of each mango type is suggested based on the stochastic program solution.

4-component relativistic atomic and molecular calculations are typically performed within the no-pair approximation where negative-energy solutions are discarded, hence the symmetry between electronic and positronic solutions is not considered. These states are however needed in QED calculations, where furthermore charge conjugation symmetry becomes an issue. In this work we shall discuss the realization of charge conjugation symmetry of the Dirac equation in a central field within the finite basis approximation. Three schemes for basis set construction are considered: restricted, inverse and dual kinetic balance. We find that charge conjugation symmetry can be realized within the restricted and inverse kinetic balance prescriptions, but only with a special form of basis functions that does not obey the right boundary conditions of the radial wavefunctions. The dual kinetic balance prescription is on the other hand compatible with charge conjugation symmetry without restricting the form of the radial basis functions. However, since charge conjugation relates solutions of opposite value of the quantum number κ, this requires the use of basis sets chosen according to total angular momentum j rather than orbital angular momentum ` . As a special case, we consider the free-particle Dirac equation, where the solutions of opposite sign of energy are related by charge conjugation symmetry. We note that there is additional symmetry in those solutions of the same value of κ come in pairs of opposite energy.

Up-conversion nanoparticles (UCNP) under near-infrared (NIR) light irradiation have been well investigated in the field of bio-imaging. However, the low up-conversion luminescence (UCL) intensity limits applications. Plasmatic modulation has been proposed as an effective tool to adjust the luminescence intensity and lifetime. In this study discrete dipole approximation (DDA) was explored concerning guiding the design of UCNP@mSiO2-Au structures with enhanced UCL intensity. The extinction effects of gold shells could be changed by adjusting the distance between the UCNPs and the Au NPs by synthesized tunable mesoporous silica (mSiO2) spacers. Enhanced UCL was obtained under 808 nm irradiation. Theoretical predictions could not be demonstrated to full extend by experimental data, indicating that better models for simulation need to better take into account inhomogeneities in particle morphologies.

We study multivariate $L_2$-approximation problem $\textrm{APP}_d$ defined over a Banach space in the average case setting. The space is equipped with a zero-mean Gaussian measure with weighted covariance kernel which depends on parameter sequences \texorpdfstring{$\a=\{\az_j\}_{j\in\N}$ and $\ba=\{\bz_j\}_{j\in\N}$}{} with $1 0$. In this paper two interesting weighted covariance kernels are considered, which model the importance of the covariance kernels. Under the absolute error criterion or the normalized error criterion, we discuss \texorpdfstring{$(s,t)$}{}-weak tractability of the \texorpdfstring{$L_2$}{}-approximation problem $\textrm{APP}=\{\textrm{APP}_d\}_{d\in\N}$ with the above two weighted covariance kernels for some positive numbers $s$ and $t$ in the average case setting, where \texorpdfstring{$(s,t)$}{}-weak tractability means that how the information complexity depends on $d$ and $\va^{-1}$ for large dimension $d$ and small threshold $\va$. In particular, for all $s>0$ and $t\in(0,1)$ we find the matching sufficient and necessary condition on the parameter sequences \texorpdfstring{$\a=\{\az_j\}_{j\in\N}$ and $\ba=\{\bz_j\}_{j\in\N}$}{} to obtain average case \texorpdfstring{$(s,t)$}{}-weak tractability under the absolute error criterion or the normalized error criterion.

Many systems in the manufacturing industry have spatial distribution characteristics, which correlate with both time and space. Such systems are known as distributed parameter systems (DPS). Due to the spatiotemporal coupling characteristics, the modeling of such systems is quite complex. The paper presents a new approach for three-dimensional fuzzy modeling using Simultaneous Perturbation Stochastic Approximation (SPSA) for nonlinear DPS. The Affinity Propagation clustering approach is utilized to dynamically determine the optimal number of fuzzy rules and construct a collection of preceding components for three-dimensional fuzzy models. Fourier space base functions are used in the resulting components of three-dimensional fuzzy models, and their parameters are learned by the SPSA algorithm. The proposed three-dimensional fuzzy modeling technique was utilized on a conventional DPS within the semiconductor manufacturing industry, with the simulation experiments confirming its efficacy.

The radiative heat transfer in arc plasma models is considered from the point of view of its description in terms of a net emission coefficient, the method of spherical harmonics in its lowest order, and the discrete ordinate method. Net emission coefficients are computed applying approximate and numerical approaches, the multi-band representation of the spectral absorption coefficient with three kinds of its averaging and two datasets. The self-consistent access to the radiative heat transfer is applied to a two-dimensional axisymmetric model of free-burning arc in argon at atmospheric pressure. The results obtained from the models employing the net emission coefficient, the method of spherical harmonics, and the discrete ordinate method are compared.

This paper provides the first-time ever analytic modelling for Pointwise Stationary Fluid Flow Approximation(PSFFA) model of the non-stationary

In the mean-field approximation, the well-known effect of the critical quantum collapse in a 3D gas of particles pulled to the center by potential U(r) = -U_0/(2r^2) is suppressed by repulsive interparticle interactions, which create the otherwise non-existing s-wave ground state. Here, we address excited bound states carrying the angular momentum, with the orbital and magnetic quantum numbers, l and m. They exist above a threshold value of the potential's strength, U_0 > l(l+1). The sectoral, tesseral, and zonal modes, which correspond to m = l, 0 < m < l, and m = 0, respectively, are found in an approximate analytical form for relatively small values of U_0 - l(l + 1). Explicit results are produced for the p- and d-wave states, with l = 1 and 2, respectively. In the general form, the bound states are obtained numerically, confirming the accuracy of the analytical approximation.

In the study of rough sets, there are many covering approximation spaces, how to classify covering approximation spaces has become a hot issue. In this paper, we propose concepts covering approximation $T_{1}$-space, $F-$symmtry, covering rough continuous mapping, covering rough homeomorphism mapping to solve this question. We also propose a new method for constructing topology in Theorem 5.1, and get the following properties: (1) For each $x\in U$, $\{X_{i}:i\in I\}\subseteq \mathcal{P}(U)$ is all the subsets of $U$ which contains $x$ and $*$ is a reflexive relation on $U$. If $V\in \tau$ is a subset of $U$ and $x\in V$, then $\underline{*}(\bigcap \limits_{i\in I}X_{i})$ is the smallest subset of $U$ and $x \in \underline{*}(\bigcap \limits_{i\in I}X_{i})\subseteq V$. Denoted by $C(x)=\bigcap \{\underline{*}(X_{i}):x\in \underline{*}(X_{i}),i\in I\}$. (2)If $V\in \tau$ is a subset of $U$, then $V =$ $\bigcup \limits_{x\in V} C(x)$. (3) Let $\{\underline{*}(X_{i}):x\notin \underline{*}(X_{i}), i\in I\}$, then $\overline{\{x\}}$ $=$ $U \setminus \bigcup \limits_{x\notin \underline{*}(X_{i}), i\in I}\underline{*}(X_{i})$; (4) Let $*$ be a reflexive relation on $U$. For every $X\subseteq U$, we have $int(\underline{*}(X))=\underline{*}(X)$. Where $int(\underline{*}(X))$ represents the interior of $\underline{*}(X)$. (5) Let $\{\underline{*}(X_{i}):x\in \underline{*}(X_{i}),i\in I\}$ be a family subsets of $U$, then $\{\underline{*}(X_{i}):x\in \underline{*}(X_{i}),i\in I\}$ is a base for $(U,\tau)$ at the point $x$. \\

The magnetic polarization tensor has a promising capability of determining the geometry and material properties of metallic samples. In this paper, a novel computation method is proposed to estimate the magnetic polarization tensors for the metallic samples using the boundary element method. In this method, the metallic sample is placed in a uniformly distributed magnetic field. Based on assumptions that the excitation frequency and/or the conductivity of the sample is very high, the metallic sample is regarded as a perfect electrical conductor (PEC). Therefore, the scattered field at a certain distance can be simulated. By utilising the boundary element method, the magnetic polarization tensor can be derived from the simulated scattered field. The theoretical calculation is presented and simulations and experiments have been carried out to validate the proposed method. The results from the simulation are matched with the analytical solution for the case of sphere samples. Moreover, there is a good agreement between the simulation results and the experimental results for the copper cylindrical samples.

In the manufacturing industry, orders are typically scheduled and delivered through batches, and the probability of machine failure under high-load operation is high. On this basis, we focus on a single machine batch scheduling problem with a maintenance interval (SMBSP-MI). The studied problem is expressed by three-field representation as 1|B,MI|\sum{F_j+\mu}m, and the optimization objective is to minimize total flow time and delivery costs. Firstly, 1|B,MI|\sum{F_j+\mu}m is proved to be NP-hard by Turing reduction. Secondly, shortest processing time (SPT) order is shown the optimal scheduling of SMBSP-MI, and a dynamic programming algorithm based on SPT (DPA-SPT) with the time complexity of O(n^3T_1) is proposed. A small-scale example is designed to verify the feasibility of DPA-SPT. Finally, DPA-SPT is approximated to a fully-polynomial dynamic programming approximation algorithm based on SPT (FDPAA-SPT) by intervals partitioning technique. The proposed FDPAA-SPT runs in O(\frac{n^5}{\varepsilon^2})\ time with the approximation (1+\varepsilon).

I demonstrate that the ionization energy (IE) and the electron affinity (EA) of organic molecular crystals can be predicted from first-principles. Here, I describe the induced electronic polarization and the electrostatic effects upon crystalline IE and EA. I also demonstrate that the electronic polarization mainly originates from the screened coulomb interaction inside the crystalline bulk phase, and that the electrostatic contribution to IE and EA crucially depends on the orientation of the molecule at the surface. The former is well described by the GW approximation, while the latter is reasonably estimated by the difference in frontier orbital energy between the gas phase and the surface at the level of a generalized gradient approximation to the density functional theory. The present methodology enables to demonstrate the impact of the electrostatic effect upon the energy level of the injected charge at a multi-monolayer surface of an organic semiconductor thin film.

We derive a concentration inequality for the uncertainty in the mean computed by stratified random sampling, and provide an online sampling method based on this inequality. Our concentration inequality is versatile and considers a range of factors including: the data ranges, weights, sizes of the strata, the number of samples taken, the estimated sample variances, and whether strata are sampled with or without replacement. Sequentially choosing samples to minimize this inequality leads to a online method for choosing samples from a stratified population. We evaluate and compare the effectiveness of our method against others for synthetic data sets, and also in approximating the Shapley value of cooperative games. Results show that our method is competitive with the performance of Neyman sampling with perfect variance information, even without having prior information on strata variances. We also provide a multidimensional extension of our inequality and discuss future applications.

In this work, numerical simulations for the absorption and scattering efficiencies of spheroid core–shell nanoparticles (CSNs) were conducted and studied using the discrete-dipole approximation method. The characteristics of surface plasmon resonances (SPR) depend upon shell thickness, the compositions of the core and shell materials, and the aspect ratio of the constructed CSNs. We used different core@shell compositions, specifically Au@SiO₂, Ag@SiO₂, Au@TiO₂, Ag@TiO₂, Au@Ag, and Ag@Au, for extinction spectra analysis. We also investigated coupled resonance mode wavelengths by adjusting the composition’s layer thickness and aspect ratio. In this study, we show that the extinction efficiency of the Ag@TiO₂ core–shell nanoparticles (CSNPs) was higher than that of the others, and we examined the impact of TiO₂ shell thickness and Ag core radius on SPR peak positions. From the extinction spectra we found that the Ag@TiO₂ nanoparticle had better refractive index sensitivity and figure of merit when the aspect ratio was set to 0.3. All of the experimental results proved that the tunability of these plasmonic resonances was highly dependent on the material used, the layer thickness, and the aspect ratio of the core@shell CSNPs.

The aim of this study is to obtain the Bayes estimators and the maximum likelihood estimators (MLEs) for the unknown parameters of the Rayleigh Weibull (RW) distribution based on progres-sive type-II censored samples. The approximate Bayes estimators are calculated using the idea of Lindley and Tierney-Kadane's approximation method under the squared-error loss function when the Bayes estimators are not handed in explicit forms. In this study, the approximate Bayes esti-mates are compared with the maximum likelihood estimates in the aspect of the estimated risks (ERs) using Monte Carlo simulation. In addition, the coverage probabilities of the parametric bootstrap estimates are calculated. Real lifetime data sets belonging to the cancer types as bladder cancer, head and neck cancer, and leukemia are used to illustrate the emprical results belonging to the approximate Bayes estimates, the maximum likelihood estimates, and the parametric bootstrap intervals.

We consider the Dirac field in polar formulation, showing that when torsion is taken in effective approximation the theory has the thermodynamic properties of a van der Waals gas, that when the limit of zero chiral angle is taken the theory reduces to that of a Weyssenhoff fluid, and that under the spinless condition it gives the Newtonian particle. This nesting of approximations will allow us to interpret the various objects pertaining to the spinor, with torsion providing a form of negative pressure, and the chiral angle being related to a type of internal dynamics.

This work aims to generate some types of M_(j )–neighborhoods. Relationships among these M_(j )-neighborhoods and some other types of neighborhoods are discussed. Additionally, M_(j )-lower, M_(j )-upper approximations and M_(j )-accuracy in terms of M_(j )-neighborhoods are presented. Their properties, with some examples, are investigated. Finally, We addressed the comparisons among M_(j )approach and other approaches.

The relative operating characteristic (ROC) curve is a popular diagnostic tool in forecast verification, with the area under the ROC curve (AUC) used as a verification metric measuring the discrimination ability of a forecast. Along with calibration, discrimination is deemed as a fundamental probabilistic forecast attribute. In particular, in ensemble forecast verification, AUC provides a basis for the comparison of potential predictive skill of competing forecasts. While this approach is straightforward when dealing with forecasts of common events (e.g. probability of precipitation), the AUC interpretation can turn out to be oversimplistic or misleading when focusing on rare events (e.g. precipitation exceeding some warning criterion). How should we interpret AUC of ensemble forecasts when focusing on rare events? How can changes in the way probability forecasts are derived from the ensemble forecast affect AUC results? How can we detect a genuine improvement in terms of predictive skill? Based on verification experiments, a critical eye is cast on the AUC interpretation to answer these questions. As well as the traditional trapezoidal approximation and the well-known bi-normal fitting model, we discuss a new approach which embraces the concept of imprecise probabilities and relies on the subdivision of the lowest ensemble probability category.

The steady-state, coupled heat and mass transfer from a fluid flow to a sphere accompanied by an exothermal catalytic chemical reaction on the surface of the sphere is analysed taking into consideration the effect of thermal radiation. The flow past the sphere is considered steady, laminar and incompressible. The radiative transfer is modeled by P₀ and P₁ approximations. The mathematical model equations were discretized by the finite difference method. The discrete equations were solved by the defect correction – multigrid method. The influence of thermal radiation on the sphere surface temperature, concentration and reaction rate was analysed for three parameter sets of the dimensionless reaction parameters. The numerical results show that only for very small values of the Prater number the effect of thermal radiation on the surface reaction is not significant.

The World Health Organization(WHO) in 2016 considered mHealth as: “the use of mobile wireless technologies including smart devices such as smartphones and smartwatches for public health” as an important resource for health services delivery and public health given their ease of use, broad reach and acceptance. WHO emphasizes the potential of this technology to increase access to health information, services and skills as well as promoting positive changes in health behaviors and management of diseases. In this regard, the capability of smartphones and smartwatches for m-health monitoring as well as verification of the patient the signal has become an important component of mHealth system. Most of the smartwatches could extract more than one bioelectrical signal therefore, therefore they provide suitable platform for extracting health data for e-monitoring. The existing approaches have not considered the integrity of data obtained from these smart devices. Therefore, it is important that the integrity of the collected data be verified continuously through user authentication. This could be done using any of the bioelectrical signals extracted and transmitted for e-monitoring. In this article, a smartwatch is used for extracting bioelectrical signal before decomposing the signal into sub-bands of Detail and Approximation Coefficient for user authentication. To select suitable features using biorthogonal wavelet decomposition of signal from a non-intrusive extraction, a detailed experiment is conducted extracting suitable statistical features from the bioelectrical signal from 30 subjects using different biorthogonal wavelet family. Ten features are extracted using Biorthogonal wavelet to decompose the signal into three levels of sub-band Detail and Approximation Coefficient and features extracted from each level the decomposed Detail and Approximation Coefficients. Comparison analysis is done after the classification of the extracted features based on the Equal Error Rate (EER). Using Neural Network (NN) classifier, Biorthogonal Wavelet Detail Coefficient Sub-band level 3 of bior1.1 achieved the best result of EER 13.80% with the fusion of the best sub-band three levels of bior1.1 achieving a better result of 12.42% EER.

This review paper deals with recently proposed algorithms for distributed blind macro-calibration of sensor networks based on consensus (synchronization), not requiring any fusion center. The basic algorithm, performing the estimation of the local calibration parameters, is derived commencing from appropriate local criteria, and developing the corresponding gradient descent scheme. It is shown that the estimated parameters of the calibration functions asymptotically converge, in the mean-square sense and with probability one (w.p.1), to such values that ensure consensus on calibrated sensor gains and calibrated sensor offsets. For the more realistic case in which additive measurement noise, communication dropouts and additive communication noise are present, two algorithm modifications are introduced: one using a simple compensation term, and a more robust one based on an instrumental variable. By utilizing stochastic approximation arguments it is shown that the modified algorithms also achieve asymptotic agreement for calibrated sensor gains and offsets, in the mean-square sense and w.p.1. Convergence rate is analyzed in terms of an upper bound of the mean-square error. It is also shown that the communications between nodes can be completely asynchronous, which is of substantial importance for real-world applications. Suggestions for design of \textit{a priori} adjustable weights are given. Finally, it is shown that, if there is a subset of (precalibrated) reference sensors with fixed calibration parameters, the calibrated sensor gains and offsets of the rest of the sensors do not achieve consensus - they converge to different points dictated by the reference sensors and the network characteristics. Wide applicability and efficacy of these algorithms are illustrated on several simulation examples.

This paper considers the problem of quantifying the quality of a model selection problem for a graphical model. The model selection problem often uses a distance measure such as the Kulback-Leibler (KL) distance to quantify the quality of the approximation between the original distribution and the model distribution. We extend this work by formulating the problem as a detection problem between the original distribution and the model distribution. In particular, we focus on the covariance selection problem by Dempster, [1], and consider the cases where the distributions are Gaussian distributions. Previous work showed that if the approximation model is a tree, that the optimal tree that minimizes the KL divergence can be found by using the Chow-Liu algorithm [2]. While the algorithm minimizes the KL divergence it does not minimize other measures such as other divergences and the area under the curve (AUC). These measures all depend on the eigenvalues of the correlation approximation measure (CAM). We find expressions for KL divergence, log-likelihood ratio, and AUC as a function of the CAM. Easily computable upper and lower bounds are also found for the AUC. The paper concludes by computing these measures for real and synthetic simulation data.

In this paper, under the symmetric entropy and the scale squared error loss functions, we consider the maximum likelihood (ML) estimation and Bayesian estimation of the Shannon entropy and Rényi entropy of the two-parameter inverse Weibull distribution. In the ML estimation, the dichotomy is used to solve likelihood equation. In addition, the approximation confidence interval is given by the Delta method. Because the form of estimation results is more complex in the Bayesian estimation, the Lindley approximation method is used to achieve the numerical calculation. Finally, Monte Carlo simulations and a real data set are used to illustrate the results derived. By comparing the mean square error between the estimated value and the real value, it can be found that the performance of ML estimation of Shannon entropy is better than that of Bayesian estimation, and there is no significant difference between the performance of ML estimation of Rényi entropy and that of Bayesian estimation.

The current work aims to develop an approximation of the slice of Minkowski sum of finite number of ellipsoids, sliced up by an arbitrarily oriented plane in Euclidean space $\mathbb{R}^3$ that, to the best of the author's knowledge, has not been addressed yet. This approximation of the actual slice is in a closed form of an explicit parametric equation in the case that the slice is not passing through those zones of the Minkowski surface with high curvatures, namely the "corners". At corners with high curvatures an alternative computational algorithm is introduced in which a family of ellipsoidal inner and outer bounds of the Minkowski's sum are used to construct a "narrow strip" for the actual slice of Minkowski sum. This strip can narrow persistently for a few more number of constructing bounds to precisely coincide on the actual slice of Minkowski sum. This algorithm is also applicable to the cases of slice of Minkowski sum of ellipsoids with high aspect ratio. In line with the main goal, some ellipsoidal inner and outer bounds of the Minkowski sum are reviewed, including the so called "Kurzhanski's" bounds. Also some ellipsoidal approximations are suggested for the Minkowski sum, which they can be used, as well as the inner and outer bounds, in calculation of the suggested parametric approximation of the slice of Minkowski sum.

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.

Since the conventional split-merge algorithm is sensitive to the object scale variance and splitting starting point, a piecewise split-merge polygon approximation method is proposed to extract the object contour features. Specifically, the contour corner is used as the starting point for the contour piecewise approximation to reduce the sensitivity of the contour segment on the starting point; then, the split-merge algorithm is used to implement the polygon approximation for each contour segments. Both the distance ratio and the arc length ratio instead of the distance error are used as the iterative stop condition to improve the robustness to the object scale variance. Both the angle and length as two features describe the shape of the contour polygon, and affect each other along the contour order relationship. Since they have a strong coupling relationship. To improve the description correction of the contour, these two features are combined to construct a Coupled Hidden Markov Model to detect the object by calculating the probability of the contour feature. The proposed algorithm is validated on ETHZ Shape Classes and INRIA Horses standard datasets. Compared with other contour-based object detection algorithms, the proposed algorithm reduces the complexity of contour description, improves the robustness of contour features to scale variance, and has a higher object detection rate.

Present study offers mathematical calculations of the roll-coating procedure lubricated with upper Convected Maxwell Fluid. An incompressible isothermal viscoelastic fluid is considered with roll and the porous web having uniform velocities. By employing Lubrication Approximation Theory, the desired equations of motion for the fluid concerned over porous web are modelled and analyzed. The suction rate on the web and injection rate at the roll surface are anticipated proportionate. Results for velocity profile and pressure gradient are obtained analytically. Fluid parameters of industrial significance i.e. detachment point, pressure, sheet /roll separating force, power contribution and coating thickness are also calculated numerically. Substantial and monotonic increase is witnessed in these quantities with the increase of flow parameters.

Background: Recurrent approximation of retention parameters in reversed-phase HPLC is effective for revealing anomalies difficult to detect otherwise, namely, the reversible hydration of analytes. This was demonstrated previously for restricted sets of analytes with acetonitrile–water eluents. Expanding the number of analytes and eluents seems to be a topical problem. Two kinds of derivatives of aromatic carbonyl compounds were characterized: unsubstituted hydrazones and oximes. Methods: If analyte demonstrates no anomalies in dependences of retention times vs. concentration of organic modifier, the recurrent approximations of these dependences are linear. To explain the features of recurrent approximations, the numerical experiments were proposed and considered. The artificial shifting of one, two, or more points allows modeling the different kinds of deviations of approximations from linearity. Results: It was shown that hydrazones are the class of analytes having no anomalies of retention parameters. On the contrary, several anomalies were detected for oximes. Downward deviations of points in the plots of recurrent approximations of retention times are the signs of reversible hydration. This effect for methanol–water eluents was detected for the first time. Some of oximes underwent hydrolysis. Conclusion: Recurrent approximation of retention times allows detecting chemical transformations of analytes during RP HPLC analysis.

New families of direct serendipity and direct mixed finite elements on general planar, strictly convex polygons were recently defined by the authors. The finite elements of index r are H1 and H(div) conforming, respectively, and approximate optimally to order r+1 while using the minimal number of degrees of freedom. The shape function space consists of the full set of polynomials defined directly on the element and augmented with a space of supplemental functions. The supplemental functions were constructed as rational functions, which can be difficult to integrate accurately using numerical quadrature rules when the index is high. This can result in a loss of accuracy in certain cases. In this work, we propose alternative ways to construct the supplemental functions on the element as continuous piecewise polynomials. One approach results in supplemental functions that are in Hp for any p≥1. We prove the optimal approximation property for these new finite elements. We also perform numerical tests on them, comparing results for the original supplemental functions and the various alternatives. The new piecewise polynomial supplements can be integrated accurately, and therefore show better robustness with respect to the underlying meshes used.

At present paper, we aim to study the long-time behavior of a stochastic semi-linear degenerate parabolic equation on bounded or unbounded domain and driven by a nonlinear noise and defined. Since the theory of pathwise random dynamical systems can not be applied directly to the equation with nonlinear noise, first, we establish the existence of weak pullback mean random attractors for the equation by applying the theory of mean-square random dynamical systems; then, we prove the existence of (pathwise) pullback random attractors for the Wong-Zakai approximate system of the equation. In addition, we establish the upper semicontinuity of pullback random attractors for the Wong-Zakai approximate system of the equation under consideration driven by a linear multiplicative noise.

Gauss quadrature integral approximation is extended to include integrals with a measure consisting of a continuous as well as a discrete component. That is, we give an approximation for the integral of a function plus its sum over a discrete weighted set.

This present work explores the performance of a thermal-magnetic engine of Otto type, considering as a working substance an effective interacting spin model corresponding to the q− state clock model. We obtain all the thermodynamic quantities for the q = 2, 4, 6, 8 cases in a small lattice size (3×3 with free boundary conditions) by using the exact partition function calculated from the energies of all the accessible microstates of the system. The extension to bigger lattices was performed using the mean-field approximation. Our results indicate that the total work extraction of the cycle is highest for the q=4 case, while the performance for the Ising model (q=2) is the lowest of all cases studied. These results are strongly linked with the phase diagram of the working substance and the location of the cycle in the different magnetic phases present, where we find that the transition from a ferromagnetic to a paramagnetic phase extracts more work than one of the Berezinskii–Kosterlitz–Thouless to paramagnetic type. Additionally, as the size of the lattice increases, the extraction work is lower than smaller lattices for all values of q presented in this study.

The meshless Petrov-Galerkin (MLPG) method is developed to analyse 2-D problems for flexoelectricity and thermoelectricity. Both problems are multiphysical and scale dependent. The size-effect is considered by the strain- and electric field-gradients in the flexoelecricity and higher-grade heat flux in the thermoelectricity. The variational principle is applied to de-rive the governing equations considered constitutive equations. The order of derivatives in governing equations is higher than in equations obtained from classical theory. The coupled governing partial differential equations (PDE) are satisfied in a local weak-form on small fic-titious subdomains with a simple test function. Physical fields are approximated by the mov-ing least-squares (MLS) scheme. Applying the spatial approximations in local integral equa-tions a system of algebraic is obtained for the nodal unknowns.

Object. Flooding in Ukraine is a common natural phenomenon that repeats periodically and in some cases it becomes disastrous. In an average year floods on the rivers of Volyn region take place from one to three times which extend beyond the limits of the floodplain. The floodplain of Styr river is located in the historical center of Lutsk city, that`s why issues of research and forecasting of floods are very important for a given city. Methodology. Using modern technologies of geodesy and remote sensing allows to quickly determine and predict the floodplain area of settlements. Based on the statistical data of the Volyn Regional Center for Hydrometeorology during the 7 year period 2011-2017 about water levels of the river Styr. We conducted mathematical modeling of fluctuations of water levels within the territory of Lutsk, based on creating a partial Fourier series for discrete values of middle-ten-day water levels values. The post hydrological measurements of Styr river water levels in the territory of Lutsk located on the Shevchenko Street comply with an altitude 172.87 meters. Based on the data of short-term flood forecasting in February and March, and relief data from the Department of Architecture and Urban Development of Volyn State Administration, we conducted visualization of the results using geographic information system QGIS. Results. The results of mathematical processing were the basis for geoinformation simulation of flooded areas using remote sensing data that are publicly available. Use of statistical and geospatial data in this article has great potential for further application in modeling the processes of natural and technogenic origin. Scientific novelty. The mathematical model of short-term forecasting of water levels during the flood period on the river Styr with implementation of geoinformation modeling of flooded areas using remote sensing data is proposed. Practical significance. The research results of water level changes on the Styr River and flood zones within the limits of Lutsk is proposed. The spring flood in February-March 2018, with the maximum water level 5.33 m, corresponds to an absolute mark of 178.20 m, which is forecasted in this article.

Floods in Ukraine is a common natural phenomenon that repeats periodically and in some cases it becomes disastrous signs. In an average year in the rivers of Volyn passes from one to three floods with going beyond the limits of the floodplain. Floodplain of Styr river is located in the historical center of Lutsk city, that`s why issues of research and forecasting of floods are very important for a given city. Using modern technologies of geodesy and remote sensing allows to quickly determine and predict the floodplain area of settlements. The research results of water level changes on the Styr River and flood zones within the limits of Lutsk is proposed. The mathematical model of short-term forecasting of water level in flood period on the river Styr with implementation of geoinformation modeling of flooded areas using remote sensing data is proposed.

Besides the Lagrangian and the Eulerian descriptions, the motion of a body can also be expressed relative to the present configuration of the body, known as the relative motion description. It is interesting to consider such a relative motion description in general to formulate the basic system of field equations for solid bodies. In doing so, when the time increment from the present state is small enough, the nonlinear constitutive equations can be linearized relative to the present state so that the resulting system becomes linear. This will be done for thermoelastic materials with a brief comment on the exploitation of entropy principle in general. Relative Lagrangian formulation is based on the well-known ``small-on-large'' idea, and can be implemented for solving problems with large deformation in successive incremental manner. Some applications of such a formulation in numerical simulations are briefly reviewed.

The prototype misfit layer compound (SnS)1.17NbS2 consists of alternatively a metallic triatomic NbS2 layer in which Nb atoms are sandwiched by S atoms and an insulating SnS double-layer of NaCl-type structure. Here we investigate the effect of lattice misfit on the stability and chemical bonding in the misfit layer compound using a first-principles density-functional theory approach. The calculations show that for the (SnS)1+xNbS2 approximants, the most stable one has x = 0.167, close to the experimental observations. Charge analysis finds a moderate charge transfer from the SnS to NbS2. Sn or S vacancies in the SnS part affect the electronic properties and interlayer interactions. The obtained information here helps understand the mechanism of formation and stability of the misfit layer compounds and ferecrystals, and further to design of novel multilayer compounds and emerging van der Waals heterostructures.

The present paper introduces a new class of Stancu-Kantorovich operators constructed in the King sense. For this class of operators we establish some convergence results, error estimations theorems and graphical properties of approximation for the cases considered, namely, operators that preserve the test functions $e_{0}(x)=1$ and $e_{1}(x)=x$, $% e_{0}(x)=1$ and $e_{2}(x)=x^{2},$ as well as $e_{1}(x)=x$ and $e_{2}(x)=x^{2} $. The new class of operators introduced in this paper is a genuine generalization of the class introduced by Indrea et al. (see Indrea A., Indrea A., Pop O. A New Class of Kantorovich-Type Operators, Constructive Mathematical Analysis).

In this paper we analyze and propose new method and algorithm of selecting the optimal labor time as a function of skills following our main references Mirrlees (1971), Saez (2001) and Stancheva (2014). The optimal labor time is a situation when the utility function of individual reaches a maximum. One of the main differences with Saez (2001) is our algorithm for creation the skill distribution

Although Shannon mutual information has been widely used, its effective calculation is often difficult for many practical problems, including those in neural population coding. Asymptotic formulas based on Fisher information sometimes provide accurate approximations to the mutual information but this approach is restricted to continuous variables because the calculation of Fisher information requires derivatives with respect to the encoded variables. In this paper, we consider information-theoretic bounds and approximations of the mutual information based on Kullback--Leibler divergence and Rényi divergence. We propose several information metrics to approximate Shannon mutual information in the context of neural population coding. While our asymptotic formulas all work for discrete variables, one of them has consistent performance and high accuracy regardless of whether the encoded variables are discrete or continuous. We performed numerical simulations and confirmed that our approximation formulas were highly accurate for approximating the mutual information between the stimuli and the responses of a large neural population. These approximation formulas may potentially bring convenience to the applications of information theory to many practical and theoretical problems.

Elucidating physicochemical processes in the degradation of pollutants may optimize their removal from water sources. This work presents a set of elementary steps in the photocatalytic degradation of carbamazepine (CBZ), assuming a steady state approximation in an Advanced Oxidation Process (AOP) combining short-wave ultraviolet radiation (UVC), homogeneous reagent (H₂O₂) and heterogeneous (TiO₂) catalyst. Elementary steps include excitation of both reagent/catalysts by UVC photons, adsorption of CBZ on the excited TiO₂, or its oxidation by hydroxyl radicals. Assuming the steady state approximation on the intermediate products (excited TiO₂, CBZ- excited TiO₂ complex, and hydroxyl radicals), leads to rate laws for degradation of CBZ, in which UVC radiation, TiO₂, and H₂O₂ are pseudo first order at all concentrations or intensities having no direct influence on CBZ pseudo-order, whereas CBZ shifts from pseudo first order at low concentrations to pseudo-zero order at high concentrations. Several experiments to test the mechanism were conducted, by varying CBZ, H₂O₂, and TiO₂ concentrations, and UVC radiation intensities. Measured results indeed fit the suggested mechanism for the first three, but irradiation intensity appears to shift CBZ influence from pseudo-second to pseudo-first order with increased intensities. Corrected elementary steps are proposed to fit the results.

Classical k-ratio models, e.g. ZAF and phi(rho z), used in electron probe microanalysis (EPMA) assume a homogeneous or multi-layered material structure, which essentially limits the spatial resolution of EPMA to the size of the interaction volume where characteristic x-rays are produced. We present a new model for characteristic x-ray emission that avoids assumptions on the material structure to not restrict the resolution of EPMA a-priori. Our model bases on the spherical harmonic (PN) approximation of the Boltzmann equation for electron transport in continuous slowing down approximation. PN models have a simple structure, are hierarchical in accuracy and well-suited for efficient adjoint-based gradient computation, which makes our model a promising alternative to classical models in terms of improving the resolution of EPMA in the future. We present results of various test cases including a comparison of the PN model to a minimum entropy moment model as well as Monte-Carlo (MC) trajectory sampling, a comparison of PN-based k-ratios to k-ratios obtained with MC, a comparison with experimental data of electron backscattering yields as well as a comparison of PN and Monte-Carlo based on characteristic X-ray generation in a three-dimensional material probe with fine structures.

In actuarial practice, the modeling of total losses tied to a certain policy is a non-trivial task. Traditional parametric models to predict total losses have limitations due to complex distributional features such as extreme skewness, zero inflation, multi-modality, etc., and the lack of explicit solutions for log-normal convolution. In the recent literature, the application of the Dirichlet process mixture for insurance loss has been proposed to eliminate the risk of model misspecification biases; however, the effect of covariates as well as missing covariates in the modeling framework is rarely studied. In this article, we propose novel connections among covariate-dependent Dirichlet process mixture, log-normal convolution, and missing covariate imputation. Assuming an individual loss is log-normally distributed, we develop a log skew-normal Dirichlet process to approximate the log-normal sum. As a generative approach, our framework models the joint of outcome and covariates, which allows to impute missing covariates under the assumption of missingness at random. The performance is assessed by applying our model to several insurance datasets, and the empirical results demonstrate the benefit of our model compared to the existing actuarial models such as the Tweedie-based generalized linear model, generalized additive model, or multivariate adaptive regression spline.

For each $t\in(-1,1)$, exact values of the least upper bounds $$ H(t)=\sup_{\E X=t,\,\E X^2=1} \frac{\E\abs{X}^3}{\E \abs{X-t}^3},\quad \sup_{\E X=t,\,\E X^2=1} \frac{L_1(X)}{L_1(X-t)} $$ are obtained, where $L_1(X)=\E|X|^3/(\E X^2)^{3/2}$ is the non-cental Lyapunov ratio. It is demonstrated that these values are attained only at two-point distributions. As a corollary, S.\,Shorgin's conjecture is proved that states that the exact value is $$ \sup\frac{L_1(X)}{L_1(X-\E X)}= \frac{\sqrt{17 + 7\sqrt7}}{4} = 1.4899\ldots, $$ where the supremum is taken over all non-degenerate distributions of the random variable $X$ with the finite third moment. Also, in terms of the central Lyapunov ratio $L_1(X-\E X)$, an analog of the Berry--Esseen inequality is proved for Poisson random sums of independent identically distributed random variables with the constant $$ 0.3031\cdot H\left(\frac{\E X}{\sqrt{\E X^2}}\right) \left(1-\frac{(\E X)^2}{\E X^2}\right)^{3/2} \le 0.3031\cdot \frac{\sqrt{17 + 7\sqrt7}}{4}<0.4517.$$ where $\Law(X)$ is the common distribution of the summands.

The imperfection of theoretical and methodological approaches to regulate the jump process transition when combining differentiated energy resources is a pressing issue. The goal of this paper is to develop a theory and a method to regulate the integration-balancing processes of combining diversified resources. The concept of combining integration and balancing models has been substantiated by methods of transforming multidimensional space and approximating generalized functions that represent jump-like processes. Theoretical and operational-regulatory models of economic sustainability have been developed, substantiating new concepts, patterns, properties, dependencies and indicators of the dynamics of the processes of combination; the optimality conditions for the number of approximations of generalized functions, interpreting the effects of control functions of combining resources, are determined. New methods for solving problems have been developed: the organization of the energy technology complex of facilities for enhanced resource diversification and the Center for Sustainability, improving the quality of managing dynamic processes in terms of combining and diversifying resources.

There exists an implicit potential limitation in every physical discoveries that has been implemented and understood. However, the limitations can be bounded within a safe limit to prevent any constructing theory to be free from errors. As, it’s the inert nature of the humans, to go far beyond the scope of experimental findings in order to pursue any studies with the sole help of logical reasoning and mathematics, the argument can be prevailed in the form of WEAK Clampdown Effect & STRONG Clampdown Effect. More, the theories are constructed out of physical nature, more the theory gets hypothetical without any finding evidence, but that does or doesn’t actually justify the phenomenon, that too with the more increment of KARDASHEV Scale, more moderate ways of experimentation got developed curbing down the limitations within the human limit of ‘ERRORS’, that does can be neglected by approximation. Relationship being cross-judgmental on the basis of the computational limits and calculation accuracy, leading to a soft singularity, as a warning, that if computer powers cannot be checked on the basis of error approximations, then this may lead to the hitting of a hard singularity, that in phase with the forbidden gap (or after the optimum limit that arises at the core constraints of nature) to prevent the computation being carried off with respect to super-intelligence machines that are cognitive capability oriented future computers responsible for self growth & reproduction with more improvement algorithm, restricting all forms of humanity & constraints the human growth by virtue of limiting capacities of the humans as compared to computers.

The solution of structural problems with nonlinear material behaviour in a model order reduction framework is investigated in this paper. In such a framework, greedy algorithms or adaptive strategies are interesting as they adjust the reduced order basis (ROB) to the problem of interest. However, these greedy strategies may lead to an excessive increase in the size of the reduced basis, i.e. the solution is no more represented in its optimal low-dimensional expansion. Here, an optimised strategy is proposed to maintain, at each step of the greedy algorithm, the lowest dimension of the PGD basis using a randomised SVD algorithm. Comparing to conventional approaches such as Gram-Schmidt orthonormalisation or deterministic SVD, it is shown to be very efficient both in terms of numerical cost and optimality of the reduced basis. Examples with different mesh densities are investigated to demonstrate the numerical efficiency of the presented method.

This paper explores innovative approaches to determining eigenvalues and eigenvectors through the combination of neural networks and traditional numerical methods. Traditional methods like the Newton-Raphson and Durand-Kerner algorithms are proven effective but often require good initial approximations and can be sensitive to the choice of starting points. In this study, we propose a hybrid approach that uses neural networks to generate better initial approximations, which are then iteratively refined using traditional methods. By combining the pattern recognition power of neural networks with the adaptability of traditional numerical methods, we demonstrate faster convergence and higher accuracy in determining eigenvalues and eigenvectors. Experimental results on various polynomials of different degrees and characteristics show that our hybrid approach outperforms individual methods, providing a more robust and efficient solution.

The entropy of the partition generated by an n-tone music scale is proposed to quantify its regularity. The normalized entropy relative to a regular partition, and its complementary, here referred to as the bias, allow to analyze various conditions of similarity between an arbitrary scale and a regular scale. Interesting particular cases are scales having limited bias because their tones are distributed along interval fractions of a regular partition. The most typical case in music concerns partitions associated with well-formed scales generated by a single tone h. These scales are maximal even sets that combine two elementary intervals. Then, the normalized entropy depends on the number of tones as well as the relative size of both elementary intervals. When well-formed scales are refined, several nested families stand out with increasing regularity. It is proven that a scale of minimal bias, i.e. with less bias than those with fewer tones, is always a best rational approximation of log2h.

This article presents a harmonic analysis of the stator currents of a squirrel-cage in-15 duction motor fed by a voltage source inverter with PWM space vector control (SV-PWM). The 16 influence of PWM switching frequency and dead time (dead-band) of controlled transistors on 17 THD and electromagnetic torque ripple is shown. The aim is to determine the lowest switching 18 frequency of the transistors for which the drive will operate correctly. Characteristics were de-19 termined as functions in the form of THD ( ), where the least square approximation was 20 used for stator current measurements when the PWM switching frequency is changed. The ap-21 proximations were realized for simulation and experimental results. To clarify the results, the 22 operation of hardware PWM circuits in microcontrollers was analyzed.

Signal approximation, is the basic idea of signal processing and mathematical analysis where complex signals can be represented with simpler ones. This paper explores unifying two mathematical fundamentals, Dirichlet-type problems, and hyperbolic series identities, into signal approximation. In this paper, we address a well-known classic topic in mathematical analysis - the Dirichlet problem - to improve (the approximation of) signal using Fourier series. We also discuss using hyperbolic series representations to increase signal modeling flexibility. In this way, we hope to create new links that span some distance along this dimension and result in a somewhat theoretical view of signal behavior - present with the mathematical rigor needed for speculation but absent from an understanding capable of appropriately handling real-world complexity. This paper provides a theoretical investigation of the mechanics at play and reveals by analogy how these mathematical tools can potentially advance signal processing techniques and understanding. This paper illustrates Fourier series and fuzzy logic methods by two case studies on signal processing, satellite communication and financial risk measurement. The first case study performs signal approximation using the Fourier series and hyperbolic function identities to provide insight into how signals behave and are modeled. The second case study deals with applying fuzzy logic for risk evaluation of investment portfolios, emphasizing the utility in evasion systems solving uncertainty and imprecision problems related to financial decisions.

Our study examines how dengue incidence is associated with spatial (demographic and socioeconomic) alongside temporal (environmental) factors at multiple scales. We used the incidence of dengue in Ibagué, Colombia, from 2013 to 2018, to examine the associations with climate, socioeconomic and demographic factors from the census and satellite imagery at various levels of local spatial aggregation, including Manzanas, Secciones, Sectores, and Comunas. Our findings show a significant effect of spatial variables at finer levels of aggregation, showing varying degrees of correlation with dengue incidence. Temporal variables such as temperature and precipitation displayed consistent patterns across all spatial levels, with notable variations in Relative Risk (RR). Our study employs Geographically Weighted Regression (GWR) to identify relevant socioeconomic and demographic predictors. Then, these predictors were integrated into hierarchical models implemented in Integrated Nested Laplace Approximation (INLA) at each spatial level to assess spatiotemporal interactions. We comprehensively analyzed the three distinct models developed for each level: spatial, temporal, and spatiotemporal. A comparative evaluation of the models reveals that while higher aggregation levels often yield a better overall model fit, finer levels offer more detailed insights into the localized impacts of socioeconomic and demographic variables on dengue incidence. Our results underscore the importance of considering macro and micro-level factors in epidemiological modeling and highlight the potential for targeted public health interventions based on localized risk factor analysis. Notably, the intermediate level Secciones emerged as the most informative, balancing spatial heterogeneity and case distribution density, thereby providing a robust framework for understanding the spatial determinants of dengue.

We describe here the coherent formulation of electromagnetism in the nonrelativistic quantummechanical many-body theory. We use the mathematical frame of the field theory and its quantization in the spirit of the QED. This is necessary because of the manifold of misinterpretations emerging from the hystorical development of quantum mechanics, starting from the Schrödinger equation of a single particle in the presence of given electromagnetic fields, followed by the many-body theories of many charged identical particles having just Coulomb interactions inspired from the classical electromagnetic theory of point-like charges. However, this later is known to be inconsistent due to the self-interaction. This way could not be continued further to include properly the magnetic forces between the charged particles and lead to a lot of confusion about the interpretation of the magnetic field in the Hamiltonian, as well as about the gauge invariance. We emphasize the importance of the distinction between the applied (external fields) and the field in the matter. All these problems are length properly solved within the non-relativistic QED, nevertheless the confusion dominates in all the problems related to the magnetic properties of the solid state.

The challenging issues of Computer Network and Databases are not only the intrusion detection but also the reduction of false positive and increase of detection rate. In any intrusion detection system, anomaly detection mainly focuses on modeling the normal behavior of the users and detecting the deviations from normal behavior which are assumed to be potential intrusions or treat. Several techniques have already been successfully tried for this purpose. However, the normal and suspicious behavior are hard to predict as there is no precise boundary differentiat-ing one from another. Here rough set theory and fuzzy set theory come into the picture. In this article, a hybrid approach based on rough set theory and intuitionistic fuzzy set theory is pro-posed for the detection of anomaly. The proposed approach is a classification approach which takes the advantages of softness properties both rough and fuzzy set theory to deal with uncer-tainty in the dataset. The algorithm classifies the data instances in such a way that they can be expressed using natural language. The experimental results with a real world dataset and a syn-thetic dataset show that the proposed algorithm has normal true positive rates of 91.989% and 96.99% and attack true positive rates of 91.289% and 96.29% respectively

The Landau damping effect was observed in collisionless plasma, as a microscopic resonant mechanism between electromagnetic radiation and the collective modes. In this paper we demonstrate the occurrence of the Landau damping at macroscopic scale in the interaction between water waves and anharmonic lattice of magnetic buoys. By coupling the Navier-Stokes equations for incompressible fluid with the nonlinear dynamics of an anharmonic magnetic lattice we obtain a resonant transfer of momentum and energy between the two systems. The velocity of the flow is obtained in the Stokes approximation with Basset type of drag force. The dynamics of the buoys is calculated in the surfactant approximation for a specific frequency, then we use Fourier analysis to obtain the general time variable interaction. After involving an integral Dirichlet transform we obtain the time dependent expression of the drag force, the interaction waves-lattice with a new term in the form of a Caputo fractional derivative. We compare the results of the model with experiments performed in a wave tank with free floating magnetic buoys under the action of small amplitude gravitational waves. This configuration can be applied in studies for the attenuation with resonant damping of rogue waves, storms or tsunamis.

One of the biggest challenges in characterizing 2-D image topographies is finding a low-dimensional parameter set that can succinctly describe, not so much image patterns themselves, but the nature of these patterns. The 2-D Cluster Variation Method (CVM), introduced by Kikuchi in 1951, can characterize very local image pattern distributions using configuration variables, identifying nearest-neighbor, next-nearest-neighbor, and triplet configurations. Using the 2-D CVM, we can characterize 2-D topographies using just two parameters; the activation enthalpy and the interaction enthalpy. Initial investigations with two different representative topographies (``scale-free-like'' and ``rich club-like'') produce interesting results when brought to a CVM free energy minimum. Additional phase space investigations, where one of these two parameters has been set to zero, identify useful parameter ranges. Careful comparison of the analytically-predicted configuration variables versus those obtained when performing computational free energy minimization on a 2-D grid show that the computational results differ significantly from the analytic solution. The 2-D CVM can potentially function as a secondary free energy minimization within the hidden layer of a neural network, providing a basis for extending node activations over time and allowing temporal correlation of patterns.

The growing market penetration of heat pumps indicates the need for a performance test method which better reflects the dynamic behavior of heat pumps. In this contribution, we developed and implemented a dynamic test method for the evaluation of the seasonal performance of heat pumps by means of laboratory testing. Current standards force the heat pump control inactive by fixing the compressor speed. In contrast, during dynamic testing, the compressor runs unfixed while the heat pump is subjected to a temperature profile. The profile consists of the different outdoor temperatures of a typical heating season based on the average European climate and also includes temperature changes to reflect the dynamic behavior of the heat pump. The seasonal performance can be directly obtained from the measured heating energy and electricity consumption making subsequent data interpolation and recalculation with correction factors obsolete. The method delivers results with high precision and high reproducibility and could be an appropriate method for a fair rating of heat pumps.

This paper investigates the search for an exact analytic solution to a temporal first-order differential equation that represents the number of customers in a non-stationary or time-varying