Search

This paper investigates the performance of a two-stage multi-criteria decision-making procedure for order scheduling problems. These problems are represented by a novel nonlinear mixed integer program. Hybridizations of three Multi-Objective Evolutionary Algorithms (MOEAs) based on dominance relations are studied and compared to solve small, medium, and large instances of the joint order batching and picking problem in storage systems with multiple blocks of two and three dimensions. The performance of these methods is compared using a set of well-known metrics and running an extensive battery of simulations based on a methodology widely used in the literature. The main contributions of this paper are (1) the hybridization of MOEAs to deal efficiently with the combination of orders in one or several picking tours, scheduling them for each picker, and (2) a multi-criteria approach to scheduling multiple picking teams for each wave of orders. Based on the experimental results obtained, it can be stated that, in environments with a large number of different items and orders with high variability in volume, the proposed approach can significantly reduce operating costs while allowing the decision-maker to anticipate the positioning of orders in the dispatch area. [ABSTRACT FROM AUTHOR]

The aim of this paper is to introduce a new type of two-dimensional convexity by using total-order relations. In the first part of this paper, we examine the Hyers–Ulam stability of two-dimensional convex mappings by using the sandwich theorem. Our next step involves the development of Hermite–Hadamard inequality, including its weighted and product forms, by using a novel type of fractional operator having non-singular kernels. Moreover, we develop several nontrivial examples and remarks to demonstrate the validity of our main results. Finally, we examine approximate convex mappings and have left an open problem regarding the best optimal constants for two-dimensional approximate convexity. [ABSTRACT FROM AUTHOR]

In this paper, we develop a two-level supply chain model with low carbon emissions for defective deteriorating items under learning in fuzzy environment by using the double inspection process. Carbon emissions are a major issue for the environment and human life when they come from many sources like different kinds of factories, firms, and industries. The burning of diesel and petrol during the supply of items through transportation is also responsible for carbon emissions. When any company, firm, or industry supplies their items through a supply chain by using of transportation in the regular mode, then a lot of carbon units are emitted from the burning of petrol and diesel, etc., which affects the supply chain. Carbon emissions can be controlled by using different kinds of policies issued by the government of a country, and lots of companies have implemented these policies to control carbon emissions. When a seller delivers a demanded lot size to the buyer, as per demand, and the lot size has some defective items, as per consideration, the demand rate is uncertain in nature. The buyer inspects the received whole lot and divides it into two categories of defective and no defective deteriorating items, as well as immediately selling at different price. The fuzzy concept nullifies the uncertain nature of the demand rate. This paper covers two models, assuming two conditions of quality screening under learning in fuzzy environment: (i) the buyer shows the quality screening and (ii) the quality inspection becomes the seller's responsibility. The carbon footprint from the transporting and warehousing the deteriorating items is also assumed. The aim of this study is to minimize the whole inventory cost for supply chains with respect to lot size and the number of orders per production cycle. Jointly optimizing the delivery lot size and number of orders per production cycle will minimize the whole fuzzy inventory cost for the supply chain and also reduce the carbon emissions. We take two numerical approaches with authentic data (from the literature reviews) for the justification of the proposed model 1 and model 2. Sensitivity observations, managerial insights, applications of these proposed models, and future scope are also included in this paper, which is more beneficial for firms, the industrial sector, and especially for online markets. The impact of the most effective parameters, like learning effect, fuzzy parameter, carbon emissions parameter, and inventory cost are shown in this study and had a positive effect on the total inventory cost for the supply chain. [ABSTRACT FROM AUTHOR]

Measuring systemic risk plays an important role in financial risk management to control systemic risk. By means of a vine copula grouped-CoES method, this paper aims to measure the systemic risk of Chinese financial markets. The empirical study indicates that the banking industry has a low risk and a strong ability to resist risks, but also contributes the most of the systemic risk. On the other hand, insurance companies and securities have high ES but low Δ CoES, indicating their low risk tolerance and small contribution to the systemic risk. Furthermore, this study employs a sliding window in Monte Carlo simulation to forecast systemic risk. The findings of this paper suggest that different types of financial industries should adopt different systemic risk measures. [ABSTRACT FROM AUTHOR]

This paper discusses the synchronization problem of impulsive stochastic bidirectional associative memory neural networks with a diffusion term, specifically focusing on the fixed-time (FXT) and predefined-time (PDT) synchronization. First, a number of more relaxed lemmas are introduced for the FXT and PDT stability of general types of impulsive nonlinear systems. A controller that does not require a sign function is then proposed to ensure that the synchronization error converges to zero within a predetermined time. The controllerdesigned in this paper serves the additional purpose of preventing the use of an unreliable inequality in the course of proving the main results. Next, to guarantee FXT and PDT synchronization of the drive–response systems, this paper employs the Lyapunov function method and derives sufficient conditions. Finally, a numerical simulation is presented to validate the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we generalize and study the concept of Hadamard product of ideals of projective varieties to the case of monomial ideals. We have a research direction similar to the one of the join of monomial ideals contained in a paper of Sturmfels and Sullivant. In the second part of the paper, we give a brief tutorial on the Hadamard.m2 package of Macaulay2. [ABSTRACT FROM AUTHOR]

Recent research has revealed that subtle imperceptible perturbations can deceive well-trained neural network models, leading to inaccurate outcomes. These instances, known as adversarial examples, pose significant threats to the secure application of machine learning techniques in safety-critical systems. In this paper, we delve into the study of one-pixel attacks in deep neural networks, recently reported as a kind of adversarial examples. To identify such one-pixel attacks, most existing methodologies rely on the differential evolution method, which utilizes random selection from the current population to escape local optima. However, the differential evolution technique might waste search time and overlook good solutions if the number of iterations is insufficient. Hence, in this paper, we propose a gradient ascent with momentum approach to efficiently discover good solutions for the one-pixel attack problem. As our method takes a more direct route to the goal compared to existing methods relying on blind random walks, it can effectively identify one-pixel attacks. Our experiments conducted on popular CNNs demonstrate that, in comparison with existing methodologies, our technique can detect one-pixel attacks significantly faster. [ABSTRACT FROM AUTHOR]

This paper discusses finding solutions to the modified Fractional Black–Scholes equation. As is well known, the options theory is beneficial in the stock market. Using call-and-pull options, investors can theoretically decide when to sell, hold, or buy shares for maximum profits. However, the process of forming the Black–Scholes model uses a normal distribution, where, in reality, the call option formula obtained is less realistic in the stock market. Therefore, it is necessary to modify the model to make the option values obtained more realistic. In this paper, the method used to determine the solution to the modified Fractional Black–Scholes equation is a combination of the finite difference method and the fractional differential transformation method. The results show that the combined method of finite difference and fractional differential transformation is a very good approximation for the solution of the Fractional Black–Scholes equation. [ABSTRACT FROM AUTHOR]

With developments in global economic integration and the increase in future economic uncertainty, it is imperative to have the ability to predict future capital in relation to financial capital inflow and outflow predictions to ensure capital optimization is within a controllable range within the current macroeconomic environment and situation. This paper proposes an automated capital prediction strategy for the capital supply chain using time series analysis artificial intelligence methods. Firstly, to analyze the fluctuation and tail risk of the financial characteristics, the paper explores the financial characteristics for measuring the dynamic VaR from the perspectives of volatility, tail, and peak with the Bayesian peaks over threshold (POT) model. Following this, in order to make the modeling more refined, the forecast targets are split before modeling with seasonal Autoregressive Integrated Moving Average (ARIMA) models and Prophet models. Finally, the time series modeling of the wavelet Long Short-Term Memory (LSTM) model is carried out using a two-part analysis method to determine the linear separated wavelet and non-linear embedded wavelet parts to predict strong volatility in financial capital. Taking the user capital flow of the Yu'e Bao platform, the results prove the feasibility and prediction accuracy of the innovative model proposed. [ABSTRACT FROM AUTHOR]

Navigation aids play a crucial role in guiding ship navigation and marking safe water areas. Therefore, ensuring the accurate and efficient recognition of a navigation aid's state is critical for maritime safety. To address the issue of sparse features in navigation aid data, this paper proposes an approach that involves three distinct processes: the extension of rank entropy space, the fusion of multi-domain features, and the extraction of hidden features (EFE). Based on these processes, this paper introduces a new LSTM model termed EFE-LSTM. Specifically, in the feature extension module, we introduce a rank entropy operator for space extension. This method effectively captures uncertainty in data distribution and the interrelationships among features. The feature fusion module introduces new features in the time domain, frequency domain, and time–frequency domain, capturing the dynamic features of signals across multiple dimensions. Finally, in the feature extraction module, we employ the BiLSTM model to capture the hidden abstract features of navigational signals, enabling the model to more effectively differentiate between various navigation aids states. Extensive experimental results on four real-world navigation aid datasets indicate that the proposed model outperforms other benchmark algorithms, achieving the highest accuracy among all state recognition models at 92.32%. [ABSTRACT FROM AUTHOR]

This paper conducts a brief survey of spatial unit roots within the context of spatial econometrics. We summarize important concepts and assumptions in this area and study the parameter space of the spatial autoregressive coefficient, which leads to the idea of spatial unit roots. Like the case in time series, the spatial unit roots lead to spurious regression because the system cannot achieve equilibrium. This phenomenon undermines the power of the usual Ordinary Least Squares (OLS) method, so various estimation methods such as Quasi-maximum Likelihood Estimate (QMLE), Two Stage Least Squares (2SLS), and Generalized Spatial Two Stage Least Squares (GS2SLS) are explored. This paper considers the assumptions needed to guarantee the identification and asymptotic properties of these methods. Because of the potential damage of spatial unit roots, we study some test procedures to detect them. Lastly, we offer insights into how to relax the compactness assumption to avoid spatial unit roots, as well as the relationship between spatial unit roots and other models, such as the Spatial Dynamic Panel Data (SDPD) model and Lévy–Brownian motion. [ABSTRACT FROM AUTHOR]

Large-scale wind farms incorporating doubly-fed induction generators (DFIGs) are considered a promising direction for modern energy supply systems due to their role in reducing dependence on fossil energy sources. However, the dynamic interactions between DFIGs and AC grids sometimes lead to sub-synchronous oscillation (SSO) that threatens the safe and stable operation of wind power systems. Therefore, it is essential to develop a mathematical model and design an algorithm to quantitatively design the control parameters. Such algorithms are helpful in preventing or mitigating system stability problems coming from wind power connected to the grid and reducing damage to power equipment. The traditional state-space model is mainly established to determine the stable operating point and analyze the influence of parameters on the system operating mode. However, this method does not provide the selection area for the system parameters. To address this shortcoming, this paper introduces a modular state-space model for DFIGs containing series compensation lines and proposes an algorithm for calculating the parameter selection area based on the Guardian map method. First, a detailed modular state-space model based on the virtual synchronous generator (VSG) control is established. The modular model helps to reflect the relationship between state variables and focuses on describing the operating state of DFIGs in wind farms. Second, this paper focuses on the influence of VSG control parameters and compensation capacitance on SSO. It aims to clarify the role of the series compensation level and control parameters on SSO based on VSG control. Then, an algorithm for the parameter selection area based on the Guardian map is proposed and the area of the VSG-controlled DFIG is obtained. Finally, the accuracy and validity of the algorithm are verified by time domain simulation in MATLAB/Simulink and HIL experiment. [ABSTRACT FROM AUTHOR]

COPA, introduced by Andreeva et al., is the first online authenticated encryption (AE) mode with nonce-misuse resistance, and it is covered in COLM, which is one of the final CAESAR portfolios. However, COPA has been proven to be insecure in the releasing unverified plaintext (RUP) setting. This paper mainly focuses on the integrity under RUP (INT-RUP) defect of COPA. Firstly, this paper revisits the INT-RUP security model for adaptive adversaries, investigates the possible factors of INT-RUP insecurity for "Encryption-Mix-Encryption"-type checksum-based AE schemes, and finds that these AE schemes with INT-RUP security vulnerabilities utilize a common poor checksum technique. Then, this paper introduces an improved checksum technique named polynomial intermediate checksum (PIC) for INT-RUP security and emphasizes that PIC is a sufficient condition for guaranteeing INT-RUP security for "Encryption-Mix-Encryption"-type checksum-based AE schemes. PIC is generated by a polynomial sum with full terms of intermediate internal states, which guarantees no information leakage. Moreover, PIC ensures the same level between the plaintext and the ciphertext, which guarantees that the adversary cannot obtain any useful information from the unverified decryption queries. Again, based on PIC, this paper proposes a modified scheme COPA-PIC to fix the INT-RUP defect of COPA. COPA-PIC is proven to be INT-RUP up to the birthday-bound security if the underlying primitive is secure. Finally, this paper discusses the properties of COPA-PIC and makes a comparison for AE modes with distinct checksum techniques. The proposed work is of good practical significance. In an interactive system where two parties communicate, the receiver can effectively determine whether the information received from the sender is valid or not, and thus perform the subsequent operation more effectively. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of parameter identification for discrete-time stochastic systems with unknown exogenous inputs. These systems form an important class of dynamic stochastic system models used to describe objects and processes under a high level of a priori uncertainty, when it is not possible to make any assumptions about the evolution of the unknown input signal or its statistical properties. The main purpose of this paper is to construct a new SVD-based modification of the existing Gillijns and De Moor filtering algorithm for linear discrete-time stochastic systems with unknown exogenous inputs. Using the theoretical results obtained, we demonstrate how this modified algorithm can be applied to solve the problem of parameter identification. The results of our numerical experiments conducted in MATLAB confirm the effectiveness of the SVD-based parameter identification method that was developed, under conditions of unknown exogenous inputs, compared to maximum likelihood parameter identification when exogenous inputs are known. [ABSTRACT FROM AUTHOR]

This paper explores two sample-based methods for analysing multistable systems: basin stability and basin entropy. Both methods rely on many numerical integration trials conducted with diverse initial conditions. The collected data is categorised and used to compute metrics that characterise solution stability, phase space structure, and system dynamics predictability. Basin stability assesses the overall likelihood of reaching specific solutions, while the basin entropy measure aims to capture the structure of attraction basins and the complexity of their boundaries. Although these two metrics complement each other effectively, their original procedures for computation differ significantly. This paper introduces a universal approach and algorithm for calculating basin stability and entropy measures. The suitability of these procedures is demonstrated through the analysis of two non-linear systems. [ABSTRACT FROM AUTHOR]

In this paper, a short review of the calculus of exact finite-differences of integer order is proposed. The finite-difference operators are called the exact finite-differences of integer orders, if these operators satisfy the same characteristic algebraic relations as standard differential operators of the same order on some function space. In this paper, we prove theorem that this property of the exact finite-differences is satisfies for the space of simple entire functions on the real axis (i.e., functions that can be expanded into power series on the real axis). In addition, new results that describe the exact finite-differences beyond the set of entire functions are proposed. A generalized expression of exact finite-differences for non-entire functions is suggested. As an example, the exact finite-differences of the square root function is considered. The use of exact finite-differences for numerical and computer simulations is not discussed in this paper. Exact finite-differences are considered as an algebraic analog of standard derivatives of integer order. [ABSTRACT FROM AUTHOR]

One of the aims of this paper is to characterize 3-complex symmetric weighted composition operators induced by three types of symbols on the weighted Bergman space of the right half-plane with the conjugation J f (z) = f (z ¯) ¯ . It is well known that the complex symmetry is equivalent to 2-complex symmetry for the weighted composition operators studied in the paper. However, the interesting fact that 3-complex symmetry is not equivalent to 2-complex symmetry for such operators is found in the paper. Finally, the complex normal of such operators on the weighted Bergman space of the right half-plane with the conjugation J is characterized. [ABSTRACT FROM AUTHOR]

Although the stability regions of wind turbines in the islanding mode have been widely researched, small-signal modeling of grid-forming wind turbines (GFWTs) in the islanding mode has yet to be explored. In addition, the state-space matrix of the wind turbine system has yet to be fully represented. Therefore, this paper proposes a small-signal modeling of GFWT and a method for identifying the stabilization region of a system with variable parameters. First, small-signal modeling of a GFWT based on virtual synchronous generator control is developed. Second, the bialternate sum matrix approach is used to determine the system stabilization region. The system matrix with multiple variable parameters is first decomposed into the sum of several matrices in this paper. Furthermore, the rotor-side generator control is simplified. It can reduce the dimensionality of the system matrix model. Finally, the simulation shows that the proposed method for determining the stabilization region of the variable system is accurate. [ABSTRACT FROM AUTHOR]

Long Short-Term Memory (LSTM) is an effective method for stock price prediction. However, due to the nonlinear and highly random nature of stock price fluctuations over time, LSTM exhibits poor stability and is prone to overfitting, resulting in low prediction accuracy. To address this issue, this paper proposes a novel variant of LSTM that couples the forget gate and input gate in the LSTM structure, and adds a "simple" forget gate to the long-term cell state. In order to enhance the generalization ability and robustness of the variant LSTM, the paper introduces an attention mechanism and combines it with the variant LSTM, presenting the Attention Mechanism Variant LSTM (AMV-LSTM) model along with the corresponding backpropagation algorithm. The parameters in AMV-LSTM are updated using the Adam gradient descent method. Experimental results demonstrate that the variant LSTM alleviates the instability and overfitting issues of LSTM, effectively improving prediction accuracy. AMV-LSTM further enhances accuracy compared to the variant LSTM, and compared to AM-LSTM, it exhibits superior generalization ability, accuracy, and convergence capability. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the consensus control problem of Euler–Lagrange systems which can be used to describe the motion of various mechanical systems such as manipulators and quadcopters. We focus on consensus control strategies, which are important for achieving coordinated behavior in multi-agent systems. The paper considers the key challenges posed by random communication delays and packet losses that are increasingly common in networked control systems. In addition, it is assumed that each system receives information from neighboring agents intermittently. Addressing these challenges is critical to ensure the reliability and efficiency of such systems in real-world applications. Communication delay is time-varying and can be very large, but should be smaller than some bounded constant. To decrease the frequency of control input updates, we implement an event-triggered scheme that regulates the controller's updates for each agent. Specifically, it does not update control inputs at traditional fixed intervals, but responds to predefined conditions and introduces a dynamic consensus item to handle information irregularities caused by communication delays and intermittent information exchange. The consensus can be achieved if the communication graph of agents contains a spanning tree with the desired velocity as the root node. That is, all Euler–Lagrange systems need to obtain the desired velocity, directly or indirectly (via neighbors), to reach consensus. We establish that the Zeno behavior can be avoided, ensuring a positive minimum duration between successive event-triggered instances. Finally, we provide simulation results to show the performance of our proposed algorithm. [ABSTRACT FROM AUTHOR]

This correction notice provides updates and corrections to a research paper on deep machine learning model-based cyber-attacks detection in smart power systems. The paper proposes a deep learning-based attack detection model that addresses system disturbances caused by natural events and cyber-attacks. It discusses the use of principal component analysis (PCA) for feature selection and the potential of deep learning-based and decision tree classifiers for detecting cyber-attacks in intelligent energy grids. The notice also includes updates to references, clarifications on the experimental data set, and feature selection based on PCA. The study evaluates the effectiveness of the proposed model using various assessment indexes and compares it to conventional methods, concluding that the proposed model is effective in detecting cyber-attacks and demonstrates good performance in detecting destructive attacks. [Extracted from the article]

In this paper, we investigate the Besov space and the Besov capacity and obtain several important capacitary inequalities in a strictly local Dirichlet space, which satisfies the doubling condition and the weak Bakry–Émery condition. It is worth noting that the capacitary inequalities in this paper are proved if the Dirichlet space supports the weak (1 , 2) -Poincaré inequality, which is weaker than the weak (1 , 1) -Poincaré inequality investigated in the previous references. Moreover, we first consider the strong subadditivity and its equality condition for the Besov capacity in metric space. [ABSTRACT FROM AUTHOR]

The rational field Q is highly desired in many applications. Algorithms using the rational number field Q algebraic number fields use only integer arithmetics and are easy to implement. Therefore, studying and designing systems and expansions with coefficients in Q or algebraic number fields is particularly interesting. This paper discusses constructing quasi-tight framelets with symmetry over an algebraic field. Compared to tight framelets, quasi-tight framelets have very similar structures but much more flexibility in construction. Several recent papers have explored the structure of quasi-tight framelets. The construction of symmetric quasi-tight framelets directly applies the generalized spectral factorization of 2 × 2 matrices of Laurent polynomials with specific symmetry structures. We adequately formulate the latter problem and establish the necessary and sufficient conditions for such a factorization over a general subfield F of C , including algebraic number fields as particular cases. Our proofs of the main results are constructive and thus serve as a guideline for construction. We provide several examples to demonstrate our main results. [ABSTRACT FROM AUTHOR]

This paper deals with the research of solutions of bounded variation (BV) to evolution inclusion coupled with a time and state dependent maximal monotone operator. Different problems are studied: existence of solutions, unicity of the solution, existence of periodic and bounded variation right continuous (BVRC) solutions. Second-order evolution inclusions and fractional (Caputo and Riemann–Liouville) differential inclusions are also considered. A result of the Skorohod problem driven by a time- and space-dependent operator under rough signal and a Volterra integral perturbation in the BRC setting is given. The paper finishes with some results for fractional differential inclusions under rough signals and Young integrals. Many of the given results are novel. [ABSTRACT FROM AUTHOR]

We study the square root computation by Leonardo Fibonacci (or Leonardo of Pisa) in his MSS Liber Abaci from c1202 and c1228 and De Practica Geometrie from c1220. In this MSS, Fibonacci systematically describes finding the integer part of the square root of an integer in numerous examples with three to seven decimal digits. The results of these examples are summarized in a table in the paper. Liber Abaci also describes in detail finding an approximation to the fractional part of the square root. However, in other examples in Liber Abaci and De Practica Geometrie, only the approximate values of the fractional part of the square roots are stated. This paper further explores these approximate values using techniques like reverse engineering. Contrary to many claims that Fibonacci also used other methods or approximations, we show that all examples can be explained using one digit-by-digit method to compute the integer part of the square root and one approximation scheme for the fractional part. Further, it is shown that the approximation scheme is tied to the method to compute the integer part of the square root. [ABSTRACT FROM AUTHOR]

This work surveys the use of directed weighted graphs in conducting comparative static analyses. The paper discusses the implementation of a computer-aided process for building spreadsheet-based graph models for inter- and intra-regional financial flows. The graph-theoretic techniques are programmed to enable the interactive visualization and analysis of financial data using Wolfram technologies (i.e., Mathematica software v. 11.3 or later, Wolfram player v. 12 or later). The paper describes the workflow for several interactive visualizations applicable to financial networks. The author provides four programs, written in the Wolfram language, that customize input–output financial models by combining the Manipulate command with built-in Mathematica functions and functions of the IGraph package (IGraph/M). The study is a tutorial article for the generation of a suite of visual schemes that provide patterns, practices, and roadmaps of the financial markets across the globe. [ABSTRACT FROM AUTHOR]

In this paper, we study a method of polynomial interpolation that lies in-between Lagrange and Hermite methods. The novelty is that we use very general nodal systems on the unit circle as well as on the bounded interval only characterized by a separation property. The way in which we interpolate consists in considering all the nodes for the prescribed values and only half for the derivatives. Firstly, we develop the theory on the unit circle, obtaining the main properties of the nodal polynomials and studying the convergence of the interpolation polynomials corresponding to continuous functions with some kind of modulus of continuity and with general conditions on the prescribed values for half of the derivatives. We complete this first part of the paper with the study of the convergence for smooth functions obtaining the rate of convergence, which is slightly slower than that when equidistributed nodal points are considered. The second part of the paper is devoted to solving a similar problem on the bounded interval by using nodal systems having good properties of separation, generalizing the Chebyshev–Lobatto system, and well related to the nodal systems on the unit circle studied before. We obtain an expression of the interpolation polynomials as well as results about their convergence in the case of continuous functions with a convenient modulus of continuity and, particularly, for differentiable functions. Finally, we present some numerical experiments related to the application of the method with the nodal systems dealt with. [ABSTRACT FROM AUTHOR]

In this paper, the derivation of a concise closed form for the gravitational field of a polyhedron is presented. This formula forms the basis of the algorithm for calculating the gravitational field of an arbitrary shape body with high accuracy. Based on this algorithm, a method for gravity data inversion (creating density models of the Earth's crust) has been developed. The algorithm can accept either regular or irregular polyhedron discretization for density model creation. The models are approximated with dense irregular grids, elements of which are polyhedrons. When performing gravity data inversion, we face three problems: topography with large amplitude, the sphericity of the planet, and a long computation time because of the large amount of data. In our previous works, we have already considered those problems separately but without explaining the details of the computation of the closed-form solution for a polyhedron. In this paper, we present for the first time a performance-effective numerical method for the inversion of gravity data based on topography. The method is based on closed-form expression for the gravity field of a spherical density model of the Earth's crust with the upper topography layer, and provides great accuracy and speed of calculation. There are no restrictions on the model's geometry or gravity data grid. As a case study, a spherical density model of the Earth's crust of the Urals is created. [ABSTRACT FROM AUTHOR]

The COVID-19 epidemic has required countries to implement different containment strategies to limit its spread, like strict or weakened national lockdown rules and the application of age-stratified vaccine prioritization strategies. These interventions have in turn modified the age-dependent patterns of social contacts. In our recent paper, starting from the available age-structured real data at the national level, we identified, for the Italian case, specific virulence parameters for a two-age-structured COVID-19 epidemic compartmental model (under 60, and 60 years and over) in six different diseases transmission scenarios under concurrently adopted feedback interventions. An interpretation of how each external scenario modifies the age-dependent patterns of social contacts and the spread of COVID-19 disease has been accordingly provided. In this paper, which can be viewed as a sequel to the previous one, we mainly apply the same general methodology therein (involving the same dynamic model) to new data covering the three subsequent additional scenarios: (i) a mitigated coordinated intermittent regional action in conjunction with the II vaccination phase; (ii) a super-attenuated coordinated intermittent regional action in conjunction with the II vaccination phase; and (iii) a last step towards normality in conjunction with the start of the III vaccination phase. As a new contribution, we show how meaningful updated information can be drawn out, once the identification of virulence parameters, characterizing the two age groups within the latest three different phases, is successfully carried out. Nevertheless, differently from our previous paper, the global optimization procedure is carried out here with the number of susceptible individuals in each scenario being left free to change, to account for reinfection and immunity due to vaccination. Not only do the slightly different estimates we obtain for the previous scenarios not impact any of the previous considerations (and thus illustrate the robustness of the procedure), but also, and mainly, the new results provide a meaningful picture of the evolution of social behaviors, along with the goodness of strategic interventions. [ABSTRACT FROM AUTHOR]

In recent years, various forms of progressive hybrid censoring schemes (PHCS) have gained significant traction in survival and reliability analysis studies due to their versatility. However, these PHCS variants are often characterized by complexity stemming from the multitude of parameters involved in their specification. Consequently, the primary objective of this paper is to propose a unified approach termed combined type II progressive hybrid censoring scheme ( ComT 2 PHCS) capable of encompassing several existing PHCS variations. Our analysis focuses specifically on the exponential distribution (ExDist). Bayesian inference techniques are employed to estimate the parameters of the ExDist under the ComT 2 PHCS. Additionally, we conduct fundamental distributional analyses and likelihood inference procedures. We derive the conditional moment-generating function (CondMGF) of maximum likelihood estimator (MLE) for parameters of the ExDist under ComT 2 PHCS. Further, we use CondMGF for the distribution of MLE for parameters of ExDist under ComT 2 PHCS. Finally, we provide an illustrative example to elucidate the inference methods derived in this paper. [ABSTRACT FROM AUTHOR]

Modeling and verification of the correct behavior of embedded real-time systems with strict timing constraints is a well-known and important problem. Failing to fulfill a deadline in system operation can have severe consequences in the practical case. This paper proposes an approach to formal modeling and schedulability analysis. A novel extension of Petri Nets named Constraint Time Petri Nets (C-TPN) is developed, which enables the modeling of a collection of interdependent real-time tasks whose execution is constrained by the use of priority and shared resources like processors and memory data. A C-TPN model is reduced to a network of Timed Automata in the context of the popular Uppaal toolbox. Both functional and, most importantly, temporal properties can be assessed by exhaustive model checking and/or statistical model checking based on simulations. This paper first describes and motivates the proposed C-TPN modeling language and its formal semantics. Then, a Uppaal translation is shown. Finally, three models of embedded real-time systems are considered, and their properties are thoroughly verified. [ABSTRACT FROM AUTHOR]

This paper presents our research on a traffic signal control system (TSCS) at V2X intersections. The overall objective of the study is to create an implementable TSCS. The specific objective of this paper is to investigate a distributed system towards implementation. The objective function of minimizing queue delay is formulated as the integral of queue lengths. The discrete queueing estimation is mixed with macro and micro traffic flow models. The novel proposed architecture alleviates the communication network bandwidth constraint by processing BSMs and computing queue lengths at the local intersection. In addition, a two-stage distributed system is designed to optimize offsets, splits, and cycle length simultaneously and in real time. The paper advances TSCS theories by contributing a novel analytic formulation of delay functions and their first degree of derivatives for a two-stage optimization model. The open-source traffic simulation engine Enhanced Transportation Flow Open-Source Microscopic Model (ETFOMM version 1.2) was selected as a simulation environment to develop, debug, and evaluate the models and the system. The control delay of the major direction, minor direction, and the total network were collected to assess the system performance. Compared with the optimized TSCS timing plan by the Virginia Department of Transportation, the system generated a 21% control delay reduction in the major direction and a 7% control delay reduction in the minor direction at just a 10% penetration rate of connected vehicles. Finally, the proposed distributed and centralized systems present similar performances in the case study. [ABSTRACT FROM AUTHOR]

Thedistribution of products stands out as one of the pivotal activities for logistics companies in recent years, particularly in the aftermath of the COVID-19 pandemic and other geopolitical events. Intense competition compels companies to efficiently execute their logistical processes, with cross-docking emerging as a frequently applied solution. However, the location of cross-dock terminals in urban areas remains a problem insufficiently addressed in the literature, with a dearth of studies and models tackling this issue. This paper introduces a novel and innovative model for locating cross-dock terminals based on the CI-DEA–IDOCRIW–MABAC (Composite Indicators–Data Envelopment Analysis-Integrated Determination of Objective Criteria Weights–Multi-Attributive Border Approximation Area Comparison) methods. In the process of defining input indicators, the following three sources were utilized: relevant literature, practical insights from logistics experts, and the knowledge and experience of the authors. Eight inputs and three outputs were considered (the number of users in the observed channel; the area served by the channel; the average distance a vehicle travels in one delivery; the required number of vehicles; labor availability; competition; construction, and expansion possibilities; proximity to the main infrastructure and traffic facilities; the average number of deliveries; average delivered quantity; and service level). The model underwent testing in a case study analyzing nine distribution channels (areas within the observed urban zone). The results indicated that alternative A4 (in the southwest area) ranked the highest since it was the best-ranked in accordance with the most important criteria, suggesting that the terminal is best located in the southwest zone. The accuracy of the results was confirmed by company management. By developing a completely new model and addressing the identified gap in the literature, this paper provides unequivocal scientific contributions. [ABSTRACT FROM AUTHOR]

This paper focuses on optimizing the Zuker RNA folding algorithm, a bioinformatics task with non-serial polyadic dynamic programming and non-uniform loop dependencies. The intricate dependence pattern is represented using affine formulas, enabling the automatic application of tiling strategies via the polyhedral method. Three source-to-source compilers—PLUTO, TRACO, and DAPT—are employed, utilizing techniques such as affine transformations, the transitive closure of dependence relation graphs, and space–time tiling to generate cache-efficient codes, respectively. A dedicated transpose code technique for non-serial polyadic dynamic programming codes is also examined. The study evaluates the performance of these optimized codes for speed-up and scalability on multi-core machines and explores energy efficiency using RAPL. The paper provides insights into related approaches and outlines future research directions within the context of bioinformatics algorithm optimization. [ABSTRACT FROM AUTHOR]

In this study, we extended the applicability of a derivative-free algorithm to encompass the solution of operators that may be either differentiable or non-differentiable. Conditions weaker than the ones in earlier studies are employed for the convergence analysis. The earlier results considered assumptions up to the existence of the ninth order derivative of the main operator, even though there are no derivatives in the algorithm, and the Taylor series on the finite Euclidian space restricts the applicability of the algorithm. Moreover, the previous results could not be used for non-differentiable equations, although the algorithm could converge. The new local result used only conditions on the divided difference in the algorithm to show the convergence. Moreover, the more challenging semi-local convergence that had not previously been studied was considered using majorizing sequences. The paper included results on the upper bounds of the error estimates and domains where there was only one solution for the equation. The methodology of this paper is applicable to other algorithms using inverses and in the setting of a Banach space. Numerical examples further validate our approach. [ABSTRACT FROM AUTHOR]

The problem of a stabilisation system synthesis for the motion of a control object along a given spatial trajectory is considered. The complexity of the problem is that the preset trajectory is defined in the state subspace and not in time. This paper describes a stabilisation system synthesis for motion along a trajectory specified in time and along a trajectory specified in the form of a manifold in a state space. In order to construct a stabilisation system, it is necessary to determine a distance between an object and the given trajectory at each moment in time. For trajectories that are not given in time, the determination of this distance can be ambiguous. An object may be exactly on a trajectory but at a different time. This paper proposes some approaches to solve the problem. One of the approaches is to transform a given trajectory in a state subspace into a trajectory given in time. A description of a universal method to perform this transformation is presented. In order to solve the synthesis problem automatically, without having to analyse the mathematical model of the control object, it is suggested that machine learning control by symbolic regression is used. In computational experiments, examples of stabilisation system syntheses for quadcopter motion along a given spatial trajectory are presented. [ABSTRACT FROM AUTHOR]

Product disassembly is an effective means of waste recycling and reutilization that has received much attention recently. In terms of disassembly efficiency, the number of disassembly skills possessed by workers plays a crucial role in improving disassembly efficiency. Therefore, in order to effectively and reasonably disassemble discarded products, this paper proposes a partial parallel disassembly line balancing problem (PP-DLBP) that takes into account the number of worker skills. In this paper, the disassembly tasks and the disassembly relationships between components are described using AND–OR graphs. In this paper, a multi-objective optimization model is established aiming to maximize the net profit of disassembly and minimize the number of skills for the workers. Based on the bat algorithm (BA), we propose an improved discrete bat algorithm (IDBA), which involves designing adaptive composite optimization operators to replace the original continuous formula expressions and applying them to solve the PP-DLBP. To demonstrate the advantages of IDBA, we compares it with NSGA-II, NSGA-III, SPEA-II, ESPEA, and MOEA/D. Experimental results show that IDBA outperforms the other five algorithms in real disassembly cases and exhibits high efficiency. [ABSTRACT FROM AUTHOR]

One of the modern, recently developed mathematical approaches for modeling various complex chaotic processes (the bacteria migration is apparently one of them), is the application of fractional differential equations. Introduction of fractional derivatives is also a very effective approach for investigation of the reactive processes (growth of bacteria in our case). Our recent advances in application of fractional differential equations for modeling the anomalous transport of reactive and non-reactive contaminants (see our recent publications in the References) allow us to expect that the anomalous transport of growing bacteria can also be effectively described by the models with fractional derivatives. Based on these modern approaches, utilizing fractional differential equations, in this paper we developed a reliable mathematical model that could be properly calibrated and, consequently, provide an adequate description of the growing bacteria transport. This model accounts for the memory effects in the bacteria transport due to the random character of bacteria trapping and release by the porous matrix. Two types of bacteria in the saturated porous medium are considered: mobile and immobile bacteria. Bacteria in the mobile phase are migrating in the fluid and have the velocity of the bulk flow, whereas bacteria in the immobile phase are the bacteria that are captured by the porous matrix. These bacteria have zero velocity and can cause clogging of some pores (therefore, porosity is possibly not constant). Examining different conventional models and comparing computations based on these models, we show that this extremely complex character of bacteria transport cannot be described by the traditional approach based on classical partial differential equations. In this paper we suggest fractional differential equations as a simple but very effective tool that can be used for constructing the proper model capable of simulating all the above-mentioned effects associated with migration of alive bacteria. Using this approach, a reliable model of the growing bacteria transport in the porous medium is developed and validated by comparison with experimental laboratory results. We proved that this novel model can be properly linearized and calibrated, so that an excellent agreement with available experimental results can be achieved. This simple model can be used in many applications, for example, as a part of more general mathematical models for predicting the outcomes of the bioremediation of contaminated soils. [ABSTRACT FROM AUTHOR]

Distributed scheduling has become a common manufacturing mode, and the distributed job scheduling problem (DJSP) has attracted more manufacturers and researchers in the field of operation research. For the distributed scheduling problem, it emphasizes the flexibility of factory assignment and determines the sequence of operation related to each machine in related factories. In this paper, a mixed-integer linear programming model for the DJSP is formulated to be optimized by an SMA. Also in this paper, a self-adaptive memetic algorithm (SMA) is proposed to obtain a near-optimal solution in a limited time for the DJSP. To strengthen the effectiveness of the SMA, an independent encoding is designed with jobs assigned to factories and the sequence of operation. In the proposed algorithm, various local search strategies related to the critical path in the critical factory are designed to enhance the quality of the solution. Moreover, the self-adaptive scheme for solution improvement is formulated to reduce the search time and avoid prematurity effectively. To demonstrate the performance of the proposed algorithm, numerical experiments are carried out on 120 different instances extended from the well-known job shop scheduling benchmarks. The proposed SMA has updated 30 instance records in 120 instances and it has obtained the 91 best records in 120 instances. According to the comparison, an SMA is a more effective algorithm that could update several records of benchmarks. [ABSTRACT FROM AUTHOR]

During the load distribution of hydropower units, the frequent crossing of vibration zones as well as large output fluctuations affect the stability of the power station. A multi-objective double-layer intelligent nesting model that considers the constraint of the output fluctuation of units is proposed to address these problems. The nonlinear constraint unit commitment optimization model layer is built based on outer dynamic programming, and the load distribution optimization model layer is constructed based on the improved biogeography-based optimization algorithm. Simultaneously, the unit output fluctuation constraint is established based on whether the unit combination changes in order to limit the unit output fluctuation. The results of this model indicate that compared with traditional load allocation models, the application of the method proposed in this paper can reduce the fluctuation range of unit output by 85.01%. In addition, except for the inevitable vibration zone crossings during startup and shutdown processes, the unit does not cross the vibration zone during operation, which greatly improves the unit's vibration isolation and optimization capabilities. The multi-objective double-layer intelligent nested model proposed in this paper has significant advantages in the field of load allocation for hydropower units. It effectively improves the stability and reliability of unit operation, and this method can be applied to practical load allocation processes. It is of great significance for the research on load allocation optimization of hydropower units. [ABSTRACT FROM AUTHOR]

This paper presents a study of fork–join systems. The fork–join system breaks down each customer into numerous tasks and processes them on separate servers. Once all tasks are finished, the customer is considered completed. This design enables the efficient handling of customers. The customers enter the system in a MAP flow. This helps create a more realistic and flexible representation of how customers arrive. It is important for modeling various real-life scenarios. Customers are divided into K ≥ 2 tasks and assigned to different subsystems. The number of tasks matches the number of subsystems. Each subsystem has a server that processes tasks, and a buffer that temporarily stores tasks waiting to be processed. The service time of a task by the k-th server follows a PH (phase-type) distribution with an irreducible representation ( β k , S k ), 1 ≤ k ≤ K . An analytical solution was derived for the case of K = 2 when the input MAP flow and service time follow a PH distribution. We have efficient algorithms to calculate the stationary distribution and performance characteristics of the fork–join system for this case. In general cases, this paper suggests using a combination of Monte Carlo and machine learning methods to study the performance of fork–join systems. In this paper, we present the results of our numerical experiments. [ABSTRACT FROM AUTHOR]

In this paper, we study the constrained minimization problem for an energy functional which is related to a Kirchhoff-type equation. For s = 1 , there many articles have analyzed the limit behavior of minimizers when η > 0 as b → 0 + or b > 0 as η → 0 + . When the equation involves a varying non-local term ∫ R 3 | ∇ u | 2 d x s , we give a detailed limit behavior analysis of constrained minimizers for any positive sequence { η k } with η k → 0 + . The present paper obtains an interesting result on this topic and enriches the conclusions of previous works. [ABSTRACT FROM AUTHOR]

This paper presents a comprehensive framework addressing optimal nonlinear analysis and feedback control synthesis for nonlinear stochastic dynamical systems. The focus lies on establishing connections between stochastic Lyapunov theory and stochastic Hamilton–Jacobi–Bellman theory within a unified perspective. We demonstrate that the closed-loop nonlinear system's asymptotic stability in probability is ensured through a Lyapunov function, identified as the solution to the steady-state form of the stochastic Hamilton–Jacobi–Bellman equation. This dual assurance guarantees both stochastic stability and optimality. Additionally, optimal feedback controllers for affine nonlinear systems are developed using an inverse optimality framework tailored to the stochastic stabilization problem. Furthermore, the paper derives stability margins for optimal and inverse optimal stochastic feedback regulators. Gain, sector, and disk margin guarantees are established for nonlinear stochastic dynamical systems controlled by nonlinear optimal and inverse optimal Hamilton–Jacobi–Bellman controllers. [ABSTRACT FROM AUTHOR]

Model averaging has become a crucial statistical methodology, especially in situations where numerous models vie to elucidate a phenomenon. Over the past two decades, there has been substantial advancement in the theory of model averaging. However, a gap remains in the field regarding model averaging in the presence of missing censoring indicators. Therefore, in this paper, we present a new model-averaging method for accelerated failure time models with right censored data when censoring indicators are missing. The model-averaging weights are determined by minimizing the Mallows criterion. Under mild conditions, the calculated weights exhibit asymptotic optimality, leading to the model-averaging estimator achieving the lowest squared error asymptotically. Monte Carlo simulations demonstrate that the method proposed in this paper has lower mean squared errors compared to other model-selection and model-averaging methods. Finally, we conducted an empirical analysis using the real-world Acute Myeloid Leukemia (AML) dataset. The results of the empirical analysis demonstrate that the method proposed in this paper outperforms existing approaches in terms of predictive performance. [ABSTRACT FROM AUTHOR]

Many properties of the structure and dynamics of complex networks derive from the characteristics of the spectrum of the associated Laplacian matrix, specifically from the set of its eigenvalues. In this paper, we show that there exist graphs for which the ratio between the length of the spectrum (that is, the difference between the largest and smallest eigenvalues of the Laplacian matrix) and its spread (the difference between the second smallest eigenvalue and the smallest one) is equal to the golden ratio. We call such graphs Golden Laplacian Graphs (GLG). In this paper, we first find all such graphs with a number of nodes n ≤ 10 . We then prove several graph-theoretic and algebraic properties that characterize these graphs. These graphs prove to be extremely robust, as they have large vertex and edge connectivity along with a large isoperimetric constant. Finally, we study the synchronization properties of GLGs, showing that they are among the top synchronizable graphs of the same size. Therefore, GLGs represent very good candidates for engineering and communication networks. [ABSTRACT FROM AUTHOR]

A new solution to the continuous-time bilinear quadratic regulator optimal control problem (CBQR) was recently developed using Krotov's Method. This paper provides two theoretical results related to the properties of that solution. The first discusses the equivalent representation of the cost-to-go performance index. The second one breaks down this equivalence into smaller identities referencing the components of the performance index. The paper shows how these results can be used to verify the numerical accuracy of the computed solution. Additionally, the meaning of the improving function and the equivalent representation, which are the main elements in the discussed CBQR's solution, are explained according to the derived notions. A numerical example of structural control application exemplifies the significance of these results and how they can be applied to a specific CBQR problem. [ABSTRACT FROM AUTHOR]

In the paper, we iteratively solve a scalar nonlinear equation f (x) = 0 , where f ∈ C (I , R) , x ∈ I ⊂ R , and I includes at least one real root r. Three novel two-step iterative schemes equipped with memory updating methods are developed; they are variants of the fixed-point Newton method. A triple data interpolation is carried out by the two-degree Newton polynomial, which is used to update the values of f ′ (r) and f ″ (r) . The relaxation factor in the supplementary variable is accelerated by imposing an extra condition on the interpolant. The new memory method (NMM) can raise the efficiency index (E.I.) significantly. We apply the NMM to five existing fourth-order iterative methods, and the computed order of convergence (COC) and E.I. are evaluated by numerical tests. When the relaxation factor acceleration technique is combined with the modified D z ˇ uni c ´ 's memory method, the value of E.I. is much larger than that predicted by the paper [Kung, H.T.; Traub, J.F. J. Assoc. Comput. Machinery 1974, 21]. for the iterative method without memory. [ABSTRACT FROM AUTHOR]

Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). To evaluate FSAs effectively, controlled environments are required, and the use of synthetic datasets offers significant advantages. We introduce a set of ten synthetically generated datasets with known relevance, redundancy, and irrelevance of features, derived from various mathematical, logical, and geometric sources. Additionally, eight FSAs are evaluated on these datasets based on their relevance and novelty. The paper first introduces the datasets and then provides a comprehensive experimental analysis of the performance of the selected FSAs on these datasets including testing the FSAs' resilience on two types of induced data noise. The analysis has guided the grouping of the generated datasets into four groups of data complexity. Lastly, we provide public access to the generated datasets to facilitate bench-marking of new feature selection algorithms in the field via our Github repository. The contributions of this paper aim to foster the development of novel feature selection algorithms and advance their study. [ABSTRACT FROM AUTHOR]

In this paper, a theoretical model of the propagation of a shear horizontal wave in a piezoelectric semiconductor semi-infinite medium is established using the optimized spectral method. First, the basic equations of the piezoelectric semiconductor semi-infinite medium are derived with the consideration of biased electric fields. Then, considering the propagation of a shear horizontal wave in the piezoelectric semiconductor semi-infinite medium, two equivalent mathematical models are established. In the first mathematical model, the Schottky junction is theoretically treated as an electrically imperfect interface, and an interface characteristic length is utilized to describe the interface effect of the Schottky junction. To legitimately confirm the interface characteristic length, a second mathematical model is established, in which the Schottky junction is theoretically treated as an electrical gradient layer. Finally, the dispersion and attenuation curves of shear horizontal waves are numerically calculated using these two mathematical models to discuss the influence of the Schottky junction on the dispersion and attenuation characteristics of shear horizontal waves. Utilizing the equivalence of these two mathematical models and the above numerical results, the numerical value of the interface characteristic length is reliably legitimately confirmed; this value is independent of the thickness of the upper metal layer, the doping concentration of the lower n-type piezoelectric semiconductor substrate, and biasing electric fields. Only the biasing electric field parallel to the Schottky junction can provide an evident influence on the attenuation characteristics of shear horizontal waves and enhance the interface effect of the Schottky junction. Since the second mathematical model is also a validation of our previous mathematical model established through the state transfer equation method, some numerical results calculated using these two mathematical models are compared with those obtained using the previous method to verify the correctness and superiority of the research work presented in this paper. Since these two mathematical models can better calculate the dispersion and attenuation curves of high-frequency waves in micro- and nano-scale piezoelectric semiconductor materials, the establishment of mathematical models and the revelation of physical mechanisms are fundamental to the analysis and optimization of micro-scale resonators, energy harvesters, and amplifications. [ABSTRACT FROM AUTHOR]

This paper investigates diverse classes of multidimensional Weyl and Doss ρ -almost periodic functions in a general measure setting. This study establishes the fundamental structural properties of these generalized ρ -almost periodic functions, extending previous classes such as m-almost periodic and (equi-)Weyl-p-almost periodic functions. Notably, a new class of (equi-)Weyl-p-almost periodic functions is introduced, where the exponent p > 0 is general. This paper delves into the abstract Volterra integro-differential inclusions, showcasing the practical implications of the derived results. This work builds upon the extensions made in the realm of Levitan N-almost periodic functions, contributing to the broader understanding of mathematical functions in diverse measure spaces. [ABSTRACT FROM AUTHOR]