Search

This paper discusses the reliability of stress and strength,R, and fuzzy stress and strength reliability, R F , based on generalized mixtures of exponential distributions. We propose several estimation methods, such as the maximize likelihood estimation, the weighted least-squares estimation, and the percentile estimation, to estimate the corresponding measures. Simulation studies have been conducted to compare the proposed estimators' performance using different settings. These comparisons are based on biases (Bias) and mean squared errors (MSEs), and we find that M S E (P E) > M S E (M L E) > M S E (W L E) and | B i a s (P E) | > | B i a s (W L E) | > | B i a s (M L E) | in most cases. Moreover, the values of R F have the same pattern as R, and the values of MSEs and biases for R F are smaller than R. As the sample size increases, the values of biases for both reliabilities decrease and approach 0. Ultimately, we apply the proposed methods to a data set to illustrate its significance. We find that the estimated values of R are greater than those of R F for all the estimation methods. Moreover, the fuzzy estimators of R F are approximately equal to the estimators R. [ABSTRACT FROM AUTHOR]

In this paper, a mathematical model is developed to simulate the activation of regulatory T lymphocytes dynamics. The model considers the adaptive immune response and consists of epithelial cells, infected cells, free virus particles, helper and cytotoxic T lymphocytes, B lymphocytes, and regulatory T lymphocytes. A mathematical analysis was carried out to discuss the conditions of existence and stability of equilibrium solutions in terms of the basic reproductive number. In addition, the definitions and properties necessary to preserve the positivity and stability of the model are shown. The precision of these mathematical models can be affected by numerous sources of uncertainty, partly due to the balance between the complexity of the model and its predictive capacity to depict the biological process accurately. Nevertheless, these models can provide remarkably perspectives on the dynamics of infection and assist in identification specific immunological traits that improve our comprehension of immune mechanisms. The theoretical results are validated by numerical simulations using data reported in the literature. The construction, analysis, and simulation of the developed models demonstrate that the increased induced regulatory T lymphocytes effectively suppress the inflammatory response in contrast to similar cells at lower contents, playing a key role in maintaining self-tolerance and immune homeostasis. [ABSTRACT FROM AUTHOR]

This paper introduces a two-echelon optimization model for the integrated routing of an electric vehicle (EV) and a traditional internal combustion engine vehicle (ICEV) in an urban environment. The scientific context of this study is sustainable urban logistics. The case study focuses on the distribution of pharmaceuticals in the metropolitan area of Rome. Distributing pharmaceuticals in large cities presents significant challenges, including heavy traffic congestion, the need for strict temperature control, and the maintenance of the integrity and timely delivery of sensitive medications. Furthermore, the complexity of urban logistics and adherence to regulatory requirements introduce additional layers of difficulty. Therefore, the implementation of fast and sustainable distribution mechanisms is crucial in this context. Specifically, the model seeks to minimize both total CO2 emissions and transportation costs while optimizing the use of an EV and an ICEV, all while ensuring that service level requirements are met. Computational results demonstrate the effectiveness of the proposed method in improving the sustainability of pharmaceutical distribution. [ABSTRACT FROM AUTHOR]

Graph query languages such as Cypher are widely adopted to match and retrieve data in a graph representation, due to their ability to retrieve and transform information. Even though the most natural way to match and transform information is through rewriting rules, those are scarcely or partially adopted in graph query languages. Their inability to do so has a major impact on the subsequent way the information is structured, as it might then appear more natural to provide major constraints over the data representation to fix the way the information should be represented. On the other hand, recent works are starting to move towards the opposite direction, as the provision of a truly general semistructured model (GSM) allows to both represent all the available data formats (Network-Based, Relational, and Semistructured) as well as support a holistic query language expressing all major queries in such languages. In this paper, we show that the usage of GSM enables the definition of a general rewriting mechanism which can be expressed in current graph query languages only at the cost of adhering the query to the specificity of the underlying data representation. We formalise the proposed query language in terms declarative graph rewriting mechanisms described as a set of production rules L → R while both providing restriction to the characterisation of L, and extending it to support structural graph nesting operations, useful to aggregate similar information around an entry-point of interest. We further achieve our declarative requirements by determining the order in which the data should be rewritten and multiple rules should be applied while ensuring the application of such updates on the GSM database is persisted in subsequent rewriting calls. We discuss how GSM, by fully supporting index-based data representation, allows for a better physical model implementation leveraging the benefits of columnar database storage. Preliminary benchmarks show the scalability of this proposed implementation in comparison with state-of-the-art implementations. [ABSTRACT FROM AUTHOR]

This paper focuses on joint production/inventory optimization in single and multiple horizons, respectively, within a complicated supply network (CSN) consisting of firm nodes with coupled demands and firm nodes with coupled demands. We first formulate the single-epoch joint optimal output model by allowing the production of extra quantity for stock underage, considering the fixed costs incurred by having inventory over demand and shortfalls. Then, the multi-temporal dynamic joint production model is further investigated to deal with stochastic demand fluctuations among CSN nodes by constructing a dynamic input–output model. The K-convexity defined in Rn space is proved to obtain the optimal control strategy. According to physical flow links, all demands associated to the nodes of CSN are categorized into the inter-node demand inside CSN (intermediate demand) and external demand outside CSN (final demand). We exploit the meliorated input–output matrix to describe demand relations, building dynamic input–output models where demand fluctuates randomly in single-cycle CSN and finite multi-cycle CSN. The novel monocyclic and multicyclic dynamic models have been developed to minimize system-wide operational costs. Unlike existent literature, we consider fixed costs incurred by overdemand and underdemand inventory into system operational cost functions and then demonstrate the convexity of objective functions. The cost function with two fixed penalty costs due to excess and shortage of inventory is developed in a multicycle model, and the K-convexity defined in Rn is proved to find out the optimal strategy for joint dynamic production of CSNs in the case of multi-products and multicycles. [ABSTRACT FROM AUTHOR]

The increasing complexity of deep learning models can make it difficult to interpret and fit models beyond a purely accuracy-focused evaluation. This is where interpretable and eXplainable Artificial Intelligence (XAI) come into play to facilitate an understanding of the inner workings of models. Consequently, alternatives have emerged, such as class activation mapping (CAM) techniques aimed at identifying regions of importance for an image classification model. However, the behavior of such models can be highly dependent on the type of architecture and the different variants of convolutional neural networks. Accordingly, this paper evaluates three Convolutional Neural Network (CNN) architectures (VGG16, ResNet50, ConvNext-T) against seven CAM models (GradCAM, XGradCAM, HiResCAM, LayerCAM, GradCAM++, GradCAMElementWise, and EigenCAM), indicating that the CAM maps obtained with ConvNext models show less variability among them, i.e., they are less dependent on the selected CAM approach. This study was performed on an image dataset for the classification of coffee leaf rust and evaluated using the RemOve And Debias (ROAD) metric. [ABSTRACT FROM AUTHOR]

This paper studies the output feedback H ∞ control problem of event-triggered Markov-type networked control systems. Firstly, a new Lyapunov–Krasovskii functional is constructed, which contains an event-triggered scheme, Markovian jump system, and quantified information. Secondly, the upper bound of the weak infinitesimal generation operator of the Lyapunov–Krasovskii function is estimated by combining Wirtinger's-based integral inequality and reciprocally convex inequality. Finally, based on the Lyapunov stability theory, the closed-loop stability criterion of event-triggered Markov-type networked control systems and the design method of the output feedback H ∞ controller for the disturbance attenuation level γ are given in the terms of linear matrix inequalities. The effectiveness and superiority of the proposed method are verified using three numerical examples. [ABSTRACT FROM AUTHOR]

This paper investigates a parameter-free H∞ differential game approach for nonlinear active vehicle suspensions. The study accounts for the geometric nonlinearity of the half-car active suspension and the cubic nonlinearity of the damping elements. The nonlinear H∞ control problem is reformulated as a zero-sum game between two players, leading to the establishment of the Hamilton–Jacobi–Isaacs (HJI) equation with a Nash equilibrium solution. To minimize reliance on model parameters during the solution process, an actor–critic framework employing neural networks is utilized to approximate the control policy and value function. An off-policy reinforcement learning method is implemented to iteratively solve the HJI equation. In this approach, the disturbance policy is derived directly from the value function, requiring only a limited amount of driving data to approximate the HJI equation's solution. The primary innovation of this method lies in its capacity to effectively address system nonlinearities without the need for model parameters, making it particularly advantageous for practical engineering applications. Numerical simulations confirm the method's effectiveness and applicable range. The off-policy reinforcement learning approach ensures the safety of the design process. For low-frequency road disturbances, the designed H∞ control policy enhances both ride comfort and stability. [ABSTRACT FROM AUTHOR]

Federated learning facilitates the training of global models in a distributed manner without requiring the sharing of raw data. This paper introduces two novel symmetric Alternating Direction Method of Multipliers (ADMM) algorithms for federated learning. The two algorithms utilize a convex combination of current local and global variables to generate relaxed steps to improve computational efficiency. They also integrate two dual-update steps with varying relaxation factors into the ADMM framework to boost the accuracy and the convergence rate. Another key feature is the use of weak parametric assumptions to enhance computational feasibility. Furthermore, the global update in the second algorithm occurs only at certain steps (e.g., at steps that are a multiple of a pre-defined integer) to improve communication efficiency. Theoretical analysis demonstrates linear convergence under reasonable conditions, and experimental results confirm the superior convergence and heightened efficiency of the proposed algorithms compared to existing methodologies. [ABSTRACT FROM AUTHOR]

Let T be a compactly generated triangulated category. In this paper, the width and local homology dimension of an object X with respect to a homogeneous ideal a , width R (a , X) and hd (a , X) , respectively, are introduced. The local nature and some basic properties of width R (a , X) and hd (a , X) are provided. In addition, we give an upper bound and lower bound of width R (a , X) . What is more, we give the relationship between the local homology dimension hd (a , X) and the arithmetic rank of a and dim R . [ABSTRACT FROM AUTHOR]

This paper proposes a second-order terminal sliding mode (2TSM) approach to the trajectory tracking of the differential drive mobile robot (DDMR). Within this cascaded control scheme, the 2TSM dynamic controller, at the innermost loop, tracks the robot's velocity quantities while a kinematic controller, at the outermost loop, regulates the robot's positions. In this manner, chattering is greatly attenuated, and finite-time convergence is guaranteed by the second-order TSM manifold, which involves higher-order derivatives of the state variables, resulting in an inherently robust as well as fast and better tracking precision. The simulation results demonstrate the merit of the proposed control methods. [ABSTRACT FROM AUTHOR]

This paper addresses the fuzzy resilient control of DC microgrids with constant power loads. The DC microgrid is subject to abrupt parameter changes which are described by the Markov jump model. Due to the constant power loads, the DC microgrid exhibits nonlinear dynamics which are characterized by a T-S fuzzy model. According to the parallel distributed compensation principle, mode-dependent fuzzy resilient controllers are designed to stabilize the resultant T-S fuzzy Markov jump DC microgrid. The "resilient" means the controller could cope with the uncertainty caused by the inaccurate execution of the control laws. This uncertainty is governed by a Bernoulli distributed random variable and thus may not occur. Then, the mean square exponential stability is analyzed for the closed-loop system by using the mode-dependent Lyapunov function. Since the stability conditions are not convex, a design algorithm is further derived to calculate the fuzzy resilient controller gains. Finally, simulations are provided to test the effectiveness of the proposed results. [ABSTRACT FROM AUTHOR]

The iterative decreasing dimension method (IDDM) is an iterative method used to solve the linear algebraic system A x = f . Such systems are important in modeling many problems in applied sciences. For a number of reasons, such as estimated measurements made for modeling, errors arising from floating point calculations, and approximation methods used for solutions, it becomes necessary to study intervals in the solutions of systems of linear equations. The objective of this paper is to utilize IDDM to achieve resolution in the interval linear system (ILS). During the calculations, the Kaucher space is considered an extended classical interval space. The solutions of Barth-Nuding and Hansen interval linear systems, which are commonly used in the literature to test the solutions of ILSs, are obtained with the interval iterative decreasing dimension method for interval linear systems (I-IDDM). Since IDDM is a variation method of Gaussian elimination, a comparative analysis of the results with the interval Gaussian elimination method (I-GEM) is performed. It has been demonstrated that our approach, I-IDDM, produces better outcomes than I-GEM. I-IDDM is also used to investigate the analog circuit problem, where interval analysis is crucial. [ABSTRACT FROM AUTHOR]

In this paper, the preview control problem for cyber–physical systems (CPSs) under denial-of-service (DOS) attacks is studied. First, we employ an attack-tolerant strategy to design an augmented error system (AES) for scenarios where both state and reference signal channels are subject to periodic attacks. We then discuss the stochastic stability conditions for the AES and derive the corresponding controller. Subsequently, the preview controller for the original system is developed. Finally, the effectiveness of the obtained results is demonstrated through a numerical simulation using an unmanned ground vehicle (UGV) model, indicating the practical applicability of the proposed control strategy. [ABSTRACT FROM AUTHOR]

In this paper, we have introduced a functional approach for approximating nonparametric functions and coefficients in the presence of multivariate and functional predictors. By utilizing the Fisher scoring algorithm and the cross-validation technique, we derived the necessary components that allow us to explain scalar responses, including the functional index, the nonlinear regression operator, the single-index component, and the systematic component. This approach effectively addresses the curse of dimensionality and can be applied to the analysis of multivariate and functional random variables in a separable Hilbert space. We employed an iterative Fisher scoring procedure with normalized B-splines to estimate the parameters, and both the theoretical and practical evaluations demonstrated its favorable performance. The results indicate that the nonparametric functions, the coefficients, and the regression operators can be estimated accurately, and our method exhibits strong predictive capabilities when applied to real or simulated data. [ABSTRACT FROM AUTHOR]

The eigenvalues of complex q-Sturm–Liouville boundary value problems are the focus of this paper. The coefficients of the corresponding q-Sturm–Liouville equation provide the lower bounds on the real parts of all eigenvalues, and the real part of the eigenvalue and the coefficients of this q-Sturm–Liouville equation provide the bounds on the imaginary part of each eigenvalue. [ABSTRACT FROM AUTHOR]

Among the existing consensus algorithms, there are very few low-latency consensus algorithms that can simultaneously take into account node dynamics, fault tolerance, and scalability, and which are applicable to large-scale open scenarios where low latency is required. Therefore, this paper proposes a low-latency scalable dynamic consensus algorithm with high fault tolerance utilizing a combination of layered and threshold signature technologies, known briefly as LTSBFT. Firstly, LTSBFT achieves linear communication complexity through the utilization of threshold signature technology and a two-layer structure. Secondly, the mutual supervision feedback mechanism among nodes enables the attainment of linear complexity for reaching consensus on the faulty upper-layer nodes during the view-change. Lastly, a node dynamic protocol was proposed for the first time to support dynamic changes in the number of nodes during the consensus process. That is to say, consensus can still be reached when the number of nodes dynamically changes without interrupting the client's request for consensus in the network. The experimental results indicate that LTSBFT exhibits lower communication latency and higher throughput compared to the classic HotStuff and PBFT algorithms. Furthermore, in comparison to double-layer PBFT, the LTSBFT has been demonstrated to have improved fault tolerance. [ABSTRACT FROM AUTHOR]

This paper considers the valuation of a vulnerable option when underlying stock is subject to liquidity risks. That is, it is assumed that the underlying stock is not perfectly liquid. We establish a framework where the stock price follows the stochastic volatility model and the option contains the default risk of the option issuer. In addition, we assume that liquidity risks are caused by stochastic market liquidity, and the default occurs at the first jump time of a stochastic Poisson process, which has a stochastic default intensity process consisting of both idiosyncratic and systematic components. By employing a change of measure, we derive an analytical formula for the value of a vulnerable option. Finally, we present several numerical examples to illustrate the sensitivity of significant parameters. [ABSTRACT FROM AUTHOR]

Extreme learning machines (ELMs), single hidden-layer feedforward neural networks, are renowned for their speed and efficiency in classification and regression tasks. However, their generalization ability is often undermined by the random generation of hidden layer weights and biases. To address this issue, this paper introduces a Hierarchical Learning-based Chaotic Crayfish Optimization Algorithm (HLCCOA) aimed at enhancing the generalization ability of ELMs. Initially, to resolve the problems of slow search speed and premature convergence typical of traditional crayfish optimization algorithms (COAs), the HLCCOA utilizes chaotic sequences for population position initialization. The ergodicity of chaos is leveraged to boost population diversity, laying the groundwork for effective global search efforts. Additionally, a hierarchical learning mechanism encourages under-performing individuals to engage in extensive cross-layer learning for enhanced global exploration, while top performers directly learn from elite individuals at the highest layer to improve their local exploitation abilities. Rigorous testing with CEC2019 and CEC2022 suites shows the HLCCOA's superiority over both the original COA and nine renowned heuristic algorithms. Ultimately, the HLCCOA-optimized extreme learning machine model, the HLCCOA-ELM, exhibits superior performance over reported benchmark models in terms of accuracy, sensitivity, and specificity for UCI breast cancer diagnosis, underscoring the HLCCOA's practicality and robustness, as well as the HLCCOA-ELM's commendable generalization performance. [ABSTRACT FROM AUTHOR]

Causal structure learning plays a crucial role in the current field of artificial intelligence, yet existing causal structure learning methods are susceptible to interference from data sample noise and often become trapped in local optima. To address these challenges, this paper introduces a continuous optimization algorithm based on the curriculum learning framework: CL-NOTEARS. The model utilizes the curriculum loss function during training as a priority evaluation metric for curriculum selection and formulates the sample learning sequence of the model through task-level curricula, thereby enhancing the model's learning performance. A curriculum-based sample prioritization strategy is employed that dynamically adjusts the training sequence based on variations in loss function values across different samples throughout the training process. The results demonstrate a significant reduction in the impact of sample noise in the data, leading to improved model training performance. [ABSTRACT FROM AUTHOR]

This paper presents several nonparametric estimators for the Sharma–Taneja–Mittal entropy measure of a continuous random variable with known support, utilizing spacing, a local linear model, and a kernel function. The properties of these estimators are discussed. Their performance was also examined through real data analysis and Monte Carlo simulations. In the Monte Carlo experiments, the proposed Sharma–Taneja–Mittal entropy estimators were employed to create a test of goodness-of-fit under the standard uniform distribution. The suggested test statistics demonstrate strong performance, as evidenced by a comparison of their power with that of other tests for uniformity. Finally, we examine a classification issue in the recognition of patterns to underscore the significance of these measures. [ABSTRACT FROM AUTHOR]

In this paper, the composite optimization problem is studied on Riemannian manifolds. To tackle this problem, the proximal gradient method to solve composite optimization problems is proposed on Riemannian manifolds. Under some reasonable conditions, the convergence of the proximal gradient method with the backtracking procedure in the nonconvex case is presented. Furthermore, a sublinear convergence rate and the complexity result of the proximal gradient method for convex case are also established on Riemannian manifolds. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of cyber-attack detection in a discrete event system by proposing a novel model. The model utilizes graph convolutional networks to extract spatial features from event sequences. Subsequently, it employs gated recurrent units to re-extract spatio-temporal features from these spatial features. The obtained spatio-temporal features are then fed into an attention model. This approach enables the model to learn the importance of different event sequences, ensuring that it is sufficiently general for identifying cyber-attacks, obviating the need to specify attack types. Compared with traditional methods that rely on synchronous product computations to synthesize diagnosers, our deep learning-based model circumvents state explosion problems. Our method facilitates real-time and efficient cyber-attack detection, eliminating the necessity to specifically identify system states or distinguish attack types, thereby significantly simplifying the diagnostic process. Additionally, we set an adjustable probability threshold to determine whether an event sequence has been compromised, allowing for customization to meet diverse requirements. Experimental results demonstrate that the proposed method performs well in cyber-attack detection, achieving over 99.9 % accuracy at a 1 % threshold and a weighted F1-score of 0.8126, validating its superior performance. [ABSTRACT FROM AUTHOR]

As claimed in many papers, the equivalence between the Caputo-type fractional differential problem and the corresponding integral forms may fail outside the spaces of absolutely continuous functions, even in Hölder spaces. To avoid such an equivalence problem, we define a "new" appropriate fractional integral operator, which is the right inverse of the Caputo derivative on some Hölder spaces of critical orders less than 1. A series of illustrative examples and counter-examples substantiate the necessity of our research. As an application, we use our method to discuss the BVP for the Langevin fractional differential equation d ψ β , μ d t β d ψ α , μ d t α + λ x (t) = f (t , x (t)) , t ∈ [ a , b ] , λ ∈ R , for f ∈ C [ a , b ] × R and some critical orders β , α ∈ (0 , 1) , combined with appropriate initial or boundary conditions, and with general classes of ψ -tempered Hilfer problems with ψ -tempered fractional derivatives. The BVP for fractional differential problems of the Bagley–Torvik type was also studied. [ABSTRACT FROM AUTHOR]

Global warming has led to the continuous deterioration of the living environment, in which air quality directly affects human health. In addition, the severity of the COVID-19 pandemic has further increased the attention to indoor air quality. Indoor clean air quality is not only related to human health but also related to the quality of the manufacturing environment of clean rooms for numerous high-tech processes, such as semiconductors and packaging. This paper proposes a comprehensive model for evaluating, analyzing, and improving the operational performance of air cleaning equipment. Firstly, three operational performance evaluation indexes, such as the number of dust particles, the number of colonies, and microorganisms, were established. Secondly, the 100(1 −   α)% upper confidence limits of these three operational performance evaluation indexes were deduced to construct a fuzzy testing model. Meanwhile, the accumulated value of ϕ was used to derive the evaluation decision-making value. The proposed model can help companies identify the key quality characteristics that need to be improved. Furthermore, the competitiveness of cooperative enterprises towards smart manufacturing can be strengthened, so that enterprises can not only fulfill their social responsibilities while developing the economy but also take into account the sustainable development of enterprises and the environment. [ABSTRACT FROM AUTHOR]

This paper is concerned with finding solutions to free-boundary inverse coefficient problems. Mathematically, we handle a one-dimensional non-homogeneous heat equation subject to initial and boundary conditions as well as non-localized integral observations of zeroth and first-order heat momentum. The direct problem is solved for the temperature distribution and the non-localized integral measurements using the Crank–Nicolson finite difference method. The inverse problem is solved by simultaneously finding the temperature distribution, the time-dependent free-boundary function indicating the location of the moving interface, and the time-wise thermal diffusivity or advection velocities. We reformulate the inverse problem as a non-linear optimization problem and use the  l s q n o n l i n  non-linear least-square solver from the MATLAB optimization toolbox. Through examples and discussions, we determine the optimal values of the regulation parameters to ensure accurate, convergent, and stable reconstructions. The direct problem is well-posed, and the Crank–Nicolson method provides accurate solutions with relative errors below  0.006 %  when the discretization elements are  M = N = 80 . The accuracy of the forward solutions helps to obtain sensible solutions for the inverse problem. Although the inverse problem is ill-posed, we determine the optimal regularization parameter values to obtain satisfactory solutions. We also investigate the existence of inverse solutions to the considered problems and verify their uniqueness based on established definitions and theorems. [ABSTRACT FROM AUTHOR]

As electric vehicles (EVs) are becoming more common and the need for sustainable energy practices is growing, better management of EV charging station loads is a necessity. The simple act of folding renewable power from solar or wind in an EV charging system presents a huge opportunity to make them even greener as well as improve grid resiliency. This paper proposes an innovative EV charging station energy consumption forecasting approach by incorporating integrated renewable energy data. The optimization is achieved through the application of SARLDNet, which enhances predictive accuracy and reduces forecast errors, thereby allowing for more efficient energy allocation and load management in EV charging stations. The technique leverages comprehensive solar and wind energy statistics alongside detailed EV charging station utilization data collected over 3.5 years from various locations across California. To ensure data integrity, missing data were meticulously addressed, and data quality was enhanced. The Boruta approach was employed for feature selection, identifying critical predictors, and improving the dataset through feature engineering to elucidate energy consumption trends. Empirical mode decomposition (EMD) signal decomposition extracts intrinsic mode functions, revealing temporal patterns and significantly boosting forecasting accuracy. This study introduces a novel stem-auxiliary-reduction-LSTM-dense network (SARLDNet) architecture tailored for robust regression analysis. This architecture combines regularization, dense output layers, LSTM-based temporal context learning, dimensionality reduction, and early feature extraction to mitigate overfitting. The performance of SARLDNet is benchmarked against established models including LSTM, XGBoost, and ARIMA, demonstrating superior accuracy with a mean absolute percentage error (MAPE) of 7.2%, Root Mean Square Error (RMSE) of 22.3 kWh, and R2 Score of 0.87. This validation of SARLDNet's potential for real-world applications, with its enhanced predictive accuracy and reduced error rates across various EV charging stations, is a reason for optimism in the field of renewable energy and EV infrastructure planning. This study also emphasizes the role of cloud infrastructure in enabling real-time forecasting and decision support. By facilitating scalable and efficient data processing, the insights generated support informed energy management and infrastructure planning decisions under dynamic conditions, empowering the audience to adopt sustainable energy practices. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach to predicting specific monitoring timeframes for Permanent Pacemaker Implantation (PPMI) requirements following a Transcatheter Aortic Valve Replacement (TAVR). The method combines Quantum Ant Colony Optimization (QACO) with the Adaptive Neuro-Fuzzy Inference System (ANFIS) and incorporates expert knowledge. Although this forecast is more precise, it requires a larger number of predictors to achieve this level of accuracy. Our model deploys expert-derived insights to guarantee the clinical relevance and interpretability of the predicted outcomes. Additionally, we employ quantum computing techniques to address this complex and high-dimensional problem. Through extensive assessments, we show that our quantum-enhanced model outperforms traditional methods with notable improvement in evaluation metrics, such as accuracy, precision, recall, and F1 score. Furthermore, with the integration of eXplainable AI (XAI) methods, our solution enhances the transparency and reliability of medical predictive models, hence promoting improved clinical practice decision-making. The findings highlight how quantum computing has the potential to completely transform predictive analytics in the medical field, especially when it comes to improving patient care after TAVR. [ABSTRACT FROM AUTHOR]

In this paper, we express ∑ n , m ≥ 1 ε 1 n ε 2 m M n (u) M m (v) n r m s (n + m) t as a linear combination of alternating multiple zeta values, where ε i ∈ { 1 , − 1 } and M k (u) ∈ { H k (u) , H ¯ k (u) } , with H k (u) and H ¯ k (u) being harmonic and alternating harmonic numbers, respectively. These sums include Subbarao and Sitaramachandrarao's alternating analogues of Tornheim's double series as a special case. Our method is based on employing two different techniques to evaluate the specific integral associated with a 3-poset Hasse diagram. [ABSTRACT FROM AUTHOR]

With applications in computer networks, robotics, genetics, data center network optimization, cryptocurrency exchange, transportation and logistics, cloud computing, and social network analysis, the problem of sorting permutations on transposition trees under various operations is highly relevant. The goal of the problem is to sort or rearrange the markers in a predetermined order by swapping them out at the vertices of a tree in the fewest possible swaps. Only certain classes of transposition trees, like path, star, and broom, have computationally efficient algorithms for sorting permutations. In this paper, we examine the so-called n − b r o o m transposition trees. A single broom or simply a b r o o m is a spanning tree formed by joining the center of the star graph with one end of the path graph. A generalized version of a broom known as an n − b r o o m is created by joining the ends of n brooms to one vertex, known as the n − b r o o m center. By using the idea of clear path markers, we present a novel algorithm for sorting permutations on an n − b r o o m for n > 2 that reduces to a novel 2 − b r o o m algorithm and that further reduces to two instances of a 1 − b r o o m algorithm. Our single-broom algorithm is similar to that of Kawahara et al.; however, our proof of optimality for the same is simpler. [ABSTRACT FROM AUTHOR]

In this paper, the Cauchy problem for the Helmholtz equation, also known as the continuation problem, is considered. The continuation problem is reduced to a boundary inverse problem for a well-posed direct problem. A generalized solution to the direct problem is obtained and an estimate of its stability is given. The inverse problem is reduced to an optimization problem solved using the gradient method. The convergence of the Landweber method with respect to the functionals is compared with the convergence of the Nesterov method. The calculation of the gradient in discrete form, which is often used in the numerical solutions of the inverse problem, is described. The formulation of the conjugate problem in discrete form is presented. After calculating the gradient, an algorithm for solving the inverse problem using the Nesterov method is constructed. A computational experiment for the boundary inverse problem is carried out, and the results of the comparative analysis of the Landweber and Nesterov methods in a graphical form are presented. [ABSTRACT FROM AUTHOR]

Today, permutation tests represent a powerful and increasingly widespread tool of statistical inference for hypothesis-testing problems. To the best of our knowledge, a review of the application of permutation tests for complex data in practical data analysis for hypothesis testing is missing. In particular, it is essential to review the application of permutation tests in two-sample or multi-sample problems and in regression analysis. The aim of this paper is to consider the main scientific contributions on the subject of permutation methods for hypothesis testing in the mentioned fields. Notes on their use to address the problem of missing data and, in particular, right-censored data, will also be included. This review also tries to highlight the limits and advantages of the works cited with a critical eye and also to provide practical indications to researchers and practitioners who need to identify flexible and distribution-free solutions for the most disparate hypothesis-testing problems. [ABSTRACT FROM AUTHOR]

The nonlinear wave equation with acoustic and fractional boundary conditions, coupled with logarithmic source and delay terms, is significant for its ability to model complex systems, its contribution to the advancement of mathematical theory, and its wide-ranging applicability to real-world problems. This paper examines the global existence and general decay of solutions to a wave equation characterized by coupling with logarithmic source and delay terms, and governed by both fractional and acoustic boundary conditions. The global existence of solutions is analyzed under a range of hypotheses, and the general decay behavior is established through the construction and application of an appropriate Lyapunov function. [ABSTRACT FROM AUTHOR]

Several variations of stochastic processes have been studied in the literature to obtain reliability estimations of products and systems from degradation data. As the degradation trajectories may have different degradation rates, it is necessary to consider alternatives to characterize their individual behavior. Some stochastic processes have a constant drift parameter, which defines the mean rate of the degradation process. However, for some cases, the mean rate must not be considered as constant, which means that the rate varies in the different stages of the degradation process. This poses an opportunity to study alternative strategies that allow to model this variation in the drift. For this, we consider the Hjorth rate, which is a failure rate that can define different shapes depending on the values of its parameters. In this paper, the integration of this hazard rate with the Wiener process is studied to individually identify the degradation rate of multiple degradation trajectories. Random effects are considered in the model to estimate a parameter of the Hjorth rate for every degradation trajectory, which allows us to identify the type of rate. The reliability functions of the proposed model is obtained through numerical integration as the function results in a complex form. The proposed model is illustrated in two case studies based on a crack propagation and infrared LED datasets. It is found that the proposed approach has better performance for the reliability estimation of products based on information criteria. [ABSTRACT FROM AUTHOR]

With the rapid development of sensor technology, the anomaly detection of multi-source time series data becomes more and more important. Traditional anomaly detection methods deal with the temporal and spatial information in the data independently, and fail to make full use of the potential of spatio-temporal information. To address this issue, this paper proposes a novel integration method that combines sensor embeddings and temporal representation networks, effectively exploiting spatio-temporal dynamics. In addition, the graph neural network is introduced to skillfully simulate the complexity of multi-source heterogeneous data. By applying a dual loss function—consisting of a reconstruction loss and a prediction loss—we further improve the accuracy of anomaly detection. This strategy not only promotes the ability to learn normal behavior patterns from historical data, but also significantly improves the predictive ability of the model, making anomaly detection more accurate. Experimental results on four multi-source sensor datasets show that our proposed method performs better than the existing models. In addition, our approach enhances the ability to interpret anomaly detection by analyzing the sensors associated with the detected anomalies. [ABSTRACT FROM AUTHOR]

The paper considers the a posteriori error estimates for fully discrete approximations of time-dependent Poisson–Nernst–Planck (PNP) equations, which provide tools that allow for optimizing the choice of each time step when working with adaptive meshes. The equations are discretized by the Backward Euler scheme in time and conforming finite elements in space. Overcoming the coupling of time and the space with a full discrete solution and dealing with nonlinearity by taking G-derivatives of the nonlinear system, the computable, robust, effective, and reliable space–time a posteriori error estimation is obtained. The adaptive algorithm constructed based on the estimates realizes the parallel adaptations of time steps and mesh refinements, which are verified by numerical experiments with the time singular point and adaptive mesh refinement with boundary layer effects. [ABSTRACT FROM AUTHOR]

In this paper, we present research results that extend and supplement our article recently published by MDPI. We derive the closed-form relations among the queue-length probabilities observed in the pre-arrival, random, and post-departure epochs for a complex, bulk-service, multi-server queueing system GI/M a , b /c. [ABSTRACT FROM AUTHOR]

Wireless power transfer (WPT) systems have ushered in a new era for wearable and implantable technologies, introducing opportunities for enhanced device functionality. A pivotal aspect in improving these devices is the optimization of electromagnetic transmission. This paper presents several solutions to improve electromagnetic transmission to an implantable/wearable device. Several scatterers are considered to mimic objects that can be easily worn by a patient, such as necklaces and bracelets, or easily integrated into textile fabric. An analytical method is employed to address the scattering by cylindrical objects above a biological tissue, modeled as a multilayer. Expansions into cylindrical waves, also represented through plane-wave spectra, are used to express the scattered fields in each medium. Numerical results for both the case of conducting and of dielectric cylindrical scatterers are presented at a frequency of the Industrial, Scientific and Medical band ( f = 2.45 GHz), showing possible configurations of worn objects for electromagnetic field intensification. [ABSTRACT FROM AUTHOR]

In this paper, we first prove the q-version of Schwarz Pick's lemma. This result improved the one presented earlier in the literature without proof. Using this novel result, we study the majorization problem for the q-general class of functions with bounded radius rotations, which we introduce here. In addition, the coefficient bound for majorized functions related to this class is derived. Relaxing the majorized condition on this general family, we obtain the estimate of coefficient bounds associated with the class. Consequently, we present new results as corollaries and point out relevant connections between the main results obtained from the ones in the literature. [ABSTRACT FROM AUTHOR]

The widespread application of mobile robots holds significant importance for advancing social intelligence. However, as the complexity of the environment increases, existing Obstacle Avoidance Path Planning (OAPP) methods tend to fall into local optimal paths, compromising reliability and practicality. Therefore, based on the Spider-Wasp Optimizer (SWO), this paper proposes an improved OAPP method called the LMBSWO to address these challenges. Firstly, the learning strategy is introduced to enhance the diversity of the algorithm population, thereby improving its global optimization performance. Secondly, the dual-median-point guidance strategy is incorporated to enhance the algorithm's exploitation capability and increase its path searchability. Lastly, a better guidance strategy is introduced to enhance the algorithm's ability to escape local optimal paths. Subsequently, the LMBSWO is employed for OAPP in five different map environments. The experimental results show that the LMBSWO achieves an advantage in collision-free path length, with 100% probability, across five maps of different complexity, while obtaining 80% fault tolerance across different maps, compared to nine existing novel OAPP methods with efficient performance. The LMBSWO ranks first in the trade-off between planning time and path length. With these results, the LMBSWO can be considered as a robust OAPP method with efficient solving performance, along with high robustness. [ABSTRACT FROM AUTHOR]

Nonlocal nonlinear Schrödinger equations are among the important models of nonlocal integrable systems. This paper aims to present a general formula for arbitrary-order breather solutions to multi-component nonlocal nonlinear Schrödinger equations by using the Hirota bilinear method. In particular, abundant wave solutions of two- and three-component nonlocal nonlinear Schrödinger equations, including periodic and mixed-wave solutions, are obtained by taking appropriate values for the involved parameters in the general solution formula. Moreover, diverse wave structures of the resulting breather and periodic wave solutions with different parameters are discussed in detail. [ABSTRACT FROM AUTHOR]

In this paper, we define the generalized Bertrand curves of non-light-like framed curves in Lorentz–Minkowski 3-space; their study is essential for understanding many classical and modern physics problems. Here, we consider two non-light-like framed curves as generalized Bertrand pairs. Our generalized Bertrand pairs can include Bertrand pairs with either singularities or not, and also include Mannheim pairs with singularities. In addition, we discuss their properties and prove the necessary and sufficient conditions for two non-light-like framed curves to be generalized Bertrand pairs. [ABSTRACT FROM AUTHOR]

This paper investigates the fault-tolerant control problem for vehicular platoons with time-varying actuator fault directions and distance constraints. A bias constraint function is introduced to convert the asymmetric constraints into symmetric ones, based on which a unified barrier Lyapunov function (BLF) method is proposed to ensure distance constraints. Further, an adaptive fixed-time fault-tolerant controller in the context of a sliding mode control technique is proposed, wherein a new Nussbaum function is adopted to address the effects of unknown time-varying actuator fault directions. It is proved that both individual vehicle stability and string stability can all be guaranteed, and the effectiveness of the proposed algorithm is verified through numerical simulations. [ABSTRACT FROM AUTHOR]

Intersecting disciplines, as an important trend in the development of modern academic research and education, have exerted a profound and positive influence on scientific research activities. Based on control theory and fractional-order theory, this paper presents a novel approach for the speed regulation of a permanent magnet synchronous motor (PMSM) in the presence of uncertainties and external disturbances. The proposed method is a composite control based on a model-free sliding mode and a fractional-order ultra-local model. The model-free sliding mode is a control strategy that utilizes the sliding mode control methodology without explicitly relying on a mathematical model of the system being controlled. The fractional-order ultra-local model is a mathematical representation of a dynamic system that incorporates the concept of fractional-order derivatives. The core of the controller is a new type of fractional-order fast nonsingular terminal sliding mode surface, which ensures high robustness, quick convergence, while preventing singularity. Moreover, a novel fractional-order nonlinear extended state observer is proposed to estimate both internal and external disturbances of the fractional-order ultra-local model. The stability of the system is analyzed using both the Lyapunov stability theory and the Mittag–Leffler stability theory. The analysis confirms the convergence stability of the closed-loop system under the proposed control scheme. The comparison results indicate that the proposed composite control based on the fractional-order ultra-local model is a promising solution for regulating the speed of PMSMs in the presence of uncertainties and disturbances. [ABSTRACT FROM AUTHOR]

In this paper, we introduce new classes of functions defined within the open unit disk by integrating the concepts of (λ , γ) -symmetrical functions, generalized Janowski functions, and quantum calculus. We derive a structural formula and a representation theorem for the class S q λ , γ (x , y , z) . Utilizing convolution techniques and quantum calculus, we investigate convolution conditions supported by examples and corollary, establishing sufficient conditions. Additionally, we derive properties related to coefficient estimates, which further elucidate the characteristics of the defined function classes. [ABSTRACT FROM AUTHOR]

Multiobjective programming refers to a mathematical problem that requires the simultaneous optimization of multiple independent yet interrelated objective functions when solving a problem. It is widely used in various fields, such as engineering design, financial investment, environmental planning, and transportation planning. Research on the theory and application of convex functions and their generalized convexity in multiobjective programming helps us understand the essence of optimization problems, and promotes the development of optimization algorithms and theories. In this paper, we firstly introduces new classes of generalized (F , α , ρ , d) − I functions for semi-preinvariant convex multiobjective programming. Secondly, based on these generalized functions, we derive several sufficient optimality conditions for a feasible solution to be an efficient or weakly efficient solution. Finally, we prove weak duality theorems for mixed-type duality. [ABSTRACT FROM AUTHOR]

This paper identifies patterns in total and per capita CO2 emissions among 208 countries considering different emission sources, such as cement, flaring, gas, oil, and coal. This research uses linear and non-linear dimensional reduction techniques, combining K-means clustering with principal component analysis (PCA) and t-distributed stochastic neighbor embedding (t-SNE), which allows the identification of distinct emission profiles among nations. This approach allows effective clustering of heterogeneous countries despite the highly dimensional nature of emissions data. The optimal number of clusters is determined using Calinski–Harabasz and Davies–Bouldin scores, of five and six clusters for total and per capita CO2 emissions, respectively. The findings reveal that for total emissions, t-SNE brings together the world's largest economies and emitters, i.e., China, USA, India, and Russia, into a single cluster, while PCA provides clusters with a single country for China, USA, and Russia. Regarding per capita emissions, PCA generates a cluster with only one country, Qatar, due to its significant flaring emissions, as byproduct of the oil industry, and its low population. This study concludes that international collaboration and coherent global policies are crucial for effectively addressing CO2 emissions and developing targeted climate change mitigation strategies. [ABSTRACT FROM AUTHOR]

In many machine learning applications, there are many scenarios when performance is not satisfactory by single classifiers. In this case, an ensemble classification is constructed using several weak base learners to achieve satisfactory performance. Unluckily, the construction of the ensemble classification is empirical, i.e., to try an ensemble classification and if performance is not satisfactory then discard it. In this paper, a challenging analytical problem of the estimation of ensemble classification using the prediction performance of the base learners is considered. The proposed formulation is aimed at estimating the performance of ensemble classification without physically developing it, and it is derived from the perspective of probability theory by manipulating the decision probabilities of the base learners. For this purpose, the output of a base learner (which is either true positive, true negative, false positive, or false negative) is considered as a random variable. Then, the effects of logical disjunction-based and majority voting-based decision combination strategies are analyzed from the perspective of conditional joint probability. To evaluate the forecasted performance of ensemble classifier by the proposed methodology, publicly available standard datasets have been employed. The results show the effectiveness of the derived formulations to estimate the performance of ensemble classification. In addition to this, the theoretical and experimental results show that the logical disjunction-based decision outperforms majority voting in imbalanced datasets and cost-sensitive scenarios. [ABSTRACT FROM AUTHOR]

This paper presents convergence analysis of a novel data-driven feedback control algorithm designed for generating online controls based on partial noisy observational data. The algorithm comprises a particle filter-enabled state estimation component, estimating the controlled system's state via indirect observations, alongside an efficient stochastic maximum principle-type optimal control solver. By integrating weak convergence techniques for the particle filter with convergence analysis for the stochastic maximum principle control solver, we derive a weak convergence result for the optimization procedure in search of optimal data-driven feedback control. Numerical experiments are performed to validate the theoretical findings. [ABSTRACT FROM AUTHOR]

Specular highlight removal is a challenging task in the field of image enhancement, while it can significantly improve the quality of image in highlight regions. Recently, deep learning-based methods have been widely adopted in this task, demonstrating excellent performance by training on either massive paired data, wherein both the highlighted and highlight-free versions of the same image are available, or unpaired datasets where the one-to-one correspondence is inapplicable. However, it is difficult to obtain the corresponding highlight-free version of a highlight image, as the latter has already been produced under specific lighting conditions. In this paper, we propose a method for weakly supervised specular highlight removal that only requires highlight images. This method involves generating highlight-free images from highlight images with the guidance of masks estimated using non-negative matrix factorization (NMF). These highlight-free images are then fed consecutively into a series of modules derived from a Cycle Generative Adversarial Network (Cycle-GAN)-style network, namely the highlight generation, highlight removal, and reconstruction modules in sequential order. These modules are trained jointly, resulting in a highly effective highlight removal module during the verification. On the specular highlight image quadruples (SHIQ) and the LIME datasets, our method achieves an accuracy of 0.90 and a balance error rate (BER) of 8.6 on SHIQ, and an accuracy of 0.89 and a BER of 9.1 on LIME, outperforming existing methods and demonstrating its potential for improving image quality in various applications. [ABSTRACT FROM AUTHOR]