Search

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]

The 3D integrated circuit (3D-IC) is garnering significant attention from academia and industry as a key technology leading the post-Moore era, offering new levels of efficiency, power, performance, and form-factor advantages to the semiconductor industry. However, thermal management in 3D-ICs presents a critical challenge that must be overcome to ensure prosperity for this technology. Unlike traditional thermal management solutions that perceive heat generation in 3D-ICs negatively and aim to eliminate it, this paper proposes, for the first time, a thermal management method that positively utilizes heat to achieve low-power operation in 3D-ICs. This approach is based on a novel discovery that circuits can reduce power consumption at higher temperatures by leveraging the temperature effect inversion (TEI) phenomenon in ultralow-voltage (ULV) operating circuits, a characteristic of low-power techniques (TEI-LP techniques). Along with a detailed explanation of this discovery, this paper introduces new thermal management technologies for practical application in 3D-ICs. Furthermore, to achieve optimal energy efficiency with the proposed technology, we develop a temperature controller essential for this purpose. The developed controller is a deep learning-based PID autotuner. This paper proves the theoretical validity of the AI control algorithm designed for this purpose and demonstrates the functional correctness and power-saving effectiveness of the developed controller through intensively conducted simulations. [ABSTRACT FROM AUTHOR]

In this paper, we develop a novel method to construct Goethals–Seidel (GS) sequences with special structures. In the existing methods, utilizing Turyn sequences is an effective and convenient approach; however, this method cannot cover all GS sequences. Motivated by this, we are devoted to designing some sequences that can potentially construct all GS sequences. Firstly, it is proven that a quad of ± 1 polynomials can be considered a linear combination of eight polynomials with coefficients uniquely belonging to { 0 , ± 1 } . Based on this fact, we change the construction of a quad of Goethals–Seidel sequences to find eight sequences consisting of 0 and ± 1 . One more motivation is to obtain these sequences more efficiently. To this end, we make use of the k-block, of which some properties of (anti) symmetry are discussed. After this, we can then look for the sequences with the help of computers since the symmetry properties facilitate reducing the search range. Moreover, we find that one of the eight blocks, which we utilize to construct GS sequences directly, can also be combined with Williamson sequences to generate GS sequences with more order. Several examples are provided to verify the theoretical results. The main contribution of this work is in building a bridge linking the GS sequences and eight polynomials, and the paper also provides a novel insight through which to consider the existence of GS sequences. [ABSTRACT FROM AUTHOR]

The effective allocation of limited resources and the establishment of targeted goals play a pivotal role in enhancing the overall efficiency of large enterprises and organizations. To achieve optimal organizational efficiency, managers seek dynamic strategies that adapt to the constraints of limited and uncertain historical data. This paper introduces an evaluation of organizational efficiency through a stochastic framework, employing a bilevel data envelopment analysis (DEA) approach. This decision-making process is centralized within a decision-making unit (DMU) overseeing subordinate decision-making units (subDMUs). Discrete scenarios, each associated with a realization probability, define the uncertain parameters in the bilevel DEA-based model. This stochastic approach allows for recourse actions upon scenario realization leading to an enhanced overall organizational strategy. Decision-makers acting within uncertain and dynamic environments can benefit from this research since it allows the investigation of efficiency assessment under alternative scenarios in the presence of volatility and risk. The potential impact of applying this methodology varies depending on the specific domain. Although, the context of this paper focuses on banking, in general, enhancing resource allocation and target setting under stochasticity, contributes to advancing sustainability across all its three dimensions (economic, environmental, social). As mentioned earlier, the practical application of our approach is demonstrated via a case study in the banking sector. [ABSTRACT FROM AUTHOR]

This paper tests using two-regime Markov-switching models with asymmetric, time-varying exponential generalized autoregressive conditional heteroskedasticity (MS-EGARCH) variances in random-length lumber futures trading. By assuming a two-regime context (a low s = 1 and high s = 2 volatility), a trading algorithm was simulated with the following trading rule: invest in lumber futures if the probability of being in the high-volatility regime s = 2 is lower or equal to 50%, or invest in the 3-month U.S. Treasury bills (TBills) otherwise. The rationale tested in this paper was that using a two-regime Markov-switching (MS) algorithm leads to an overperformance against a buy-and-hold strategy in lumber futures. To extend the current literature in MS trading algorithms, two location parameter scenarios were simulated. The first uses an unconditional mean or expected value (no factors), and the second incorporates market and behavioral factors. With weekly simulations form 2 January 1994 to 28 July 2023, the results suggest that using MS-EGARCH models in a no-factors scenario is appropriate for active lumber futures trading with an accumulated return of 158.33%. Also, the results suggest that it is not useful to add market and behavioral factors in the MS-GARCH estimation because it leads to a lower performance. [ABSTRACT FROM AUTHOR]

This paper delves into the asymptotic and oscillatory behavior of all classes of solutions of fourth-order nonlinear neutral delay differential equations in the noncanonical form with damping terms. This research aims to improve the relationships between the solutions of these equations and their corresponding functions and derivatives. By refining these relationships, we unveil new insights into the asymptotic properties governing these solutions. These insights lead to the establishment of improved conditions that ensure the nonexistence of any positive solutions to the studied equation, thus obtaining improved oscillation criteria. In light of the broader context, our findings extend and build upon the existing literature in the field of neutral differential equations. To emphasize the importance of the results and their applicability, this paper concludes with some examples. [ABSTRACT FROM AUTHOR]

Due to the facts that epidemic-related parameters vary significantly in different stages of infectious diseases and are relatively stable within the same stage, infectious disease models should be switch-type models. However, research on switch-type infectious disease models is scarce due to the complexity and intricate design of switching rules. This scarcity has motivated the writing of this paper. By assuming that switching instants and impulse times occur at different moments, this paper proposes switch rules suitable for impulse control and derives synchronization criteria for reaction–diffusion switch-type infectious disease systems under impulse control. The effectiveness of this method is validated through numerical simulations. It is important to mention that, based on the information available to us, this paper is currently the sole study focusing on switch-type reaction–diffusion models for infectious diseases. [ABSTRACT FROM AUTHOR]

The application of blockchain has become a trend in the development of supply chain finance. Aiming to bridge the gap in the existing literature, this paper investigates a supply chain finance system based on blockchain technology which contains a manufacturer, a retailer and a financial institution and incorporates blockchain costs into the model. Firstly, this paper establishes a supply chain finance model based on blockchain technology and it presents a comparison with the process employed under the traditional model. Secondly, this paper establishes the revenue mathematical model of supply chain finance based on blockchain technology. Thirdly, the optimal decisions of each participant under centralized and decentralized decision-making are proved and obtained, respectively, and the influencing factors of the optimal decisions are analyzed. Finally, the conclusions are verified via simulations. This study finds that, when blockchain is used, the benefits of each participant in the chain are increased. In addition, centralized decision-making, which is more optimal in the traditional model, is also enhanced under blockchain. This paper demonstrates the superiority of blockchain-enabled supply chain finance in terms of model and revenue. This provides some suggestions for companies in the supply chain with regard to solving the problem of financing difficulties. [ABSTRACT FROM AUTHOR]

The present paper describes, in a theoretical fashion, a variational approach to formulate fourth-order dynamical systems on differentiable manifolds on the basis of the Hamilton–d'Alembert principle of analytic mechanics. The discussed approach relies on the introduction of a Lagrangian function that depends on the kinetic energy and the covariant acceleration energy, as well as a potential energy function that accounts for conservative forces. In addition, the present paper introduces the notion of Rayleigh differential form to account for non-conservative forces. The corresponding fourth-order equation of motion is derived, and an interpretation of the obtained terms is provided from a system and control theoretic viewpoint. A specific form of the Rayleigh differential form is introduced, which yields non-conservative forcing terms assimilable to linear friction and jerk-type friction. The general theoretical discussion is complemented by a brief excursus about the numerical simulation of the introduced differential model. [ABSTRACT FROM AUTHOR]

The object of the investigation is a model of the incomplete financial market. It includes a bank deposit with a known interest rate and basic risky securities. The instant interest rate and volatility are governed by a hidden market regime, represented by some finite-state Markov jump process. The paper presents a solution to two problems. The first one consists of the characterization of the derivatives based on the existing market securities, which are valid to complete the considered market. It is determined that for the market completion, it is sufficient to add the number of derivatives equal to the number of possible market regimes. A generalization of the classic Black–Scholes equation, describing the evolution of the fair derivative price, is obtained along with the structure of a self-financing portfolio, replicating an arbitrary contingent claim in the market. The second problem consists of the online estimation of the market regime, given the observations of both the underlying and derivative prices. The available observations are either a combination of the time-discretized risky security prices or some high-frequency multivariate point processes associated with these prices. The paper presents the numerical algorithms of the market regime tracking for both observation types. The comparative numerical experiments illustrate the high quality of the proposed estimates. [ABSTRACT FROM AUTHOR]

Keyword pools are used as search queries to collect web texts, largely determining the size and coverage of the samples and provide a data base for subsequent text mining. However, how to generate a refined keyword pool with high similarity and some expandability is a challenge. Currently, keyword pools for search queries aimed at collecting web texts either lack an objective generation method and evaluation system, or have a low utilization rate of sample semantic information. Therefore, this paper proposed a keyword generation framework that integrates sample and semantic information to construct a complete and objective keyword pool generation and evaluation system. The framework includes a data phase and a modeling phase, and its core is in the modeling phase, where both feature ranking and model performance are considered. A regression model about a topic vector and word vectors is constructed for the first time based on word embedding, and keyword pools are generated from the perspective of model performance. In addition, two keyword generation methods, Recursive Feature Introduction (RFI) and Recursive Feature Introduction and Elimination (RFIE), are also proposed in this paper. Different feature ranking algorithms, keyword generation methods and regression models are compared in the experiments. The results show that: (1) When using RFI to generate keywords, the regression model using ranked features has better prediction performance than the baseline model, and the number of generated keywords is refiner, and the prediction performance of the regression model using tree-based ranked features is significantly better than that of the one using SHAP-based ranked features. (2) The prediction performance of the regression model using RFI with tree-based ranked features is significantly better than that using Recursive Feature Elimination (RFE) with tree-based one. (3) All four regression models using RFI/RFE with SHAP- based/tree-based ranked features have significantly higher average similarity scores and cumulative advantages than the baseline model (the model using RFI with unranked features). (4) Light Gradient Boosting Machine (LGBM) using RFI with SHAP-based ranked features has significantly better prediction performance, higher average similarity scores, and cumulative advantages. In conclusion, our framework can generate a keyword pool that is more similar to the topic, and more refined and expandable, which provides certain research ideas for expanding the research sample size while ensuring the coverage of topics in web text collecting. [ABSTRACT FROM AUTHOR]

With the frequent occurrence of financial risks, financial innovation supervision has become an important research issue, and excellent regulatory strategies are of great significance to maintain the stability and sustainable development of financial markets. Thus, this paper intends to analyze the financial regulation strategies through evolutionary game theory. In this paper, the delayed replication dynamic equation and the non-delayed replication dynamic equation are established, respectively, under different reward and punishment mechanisms, and their stability conditions and evolutionary stability strategies are investigated. The analysis finds that under the static mechanism, the internal equilibrium is unstable, and the delay does not affect the stability of the system, while in the dynamic mechanism, when the delay is less than a critical value, the two sides of the game have an evolutionary stable strategy, otherwise it is unstable, and Hopf bifurcation occurs at threshold. Finally, some numerical simulation examples are provided, and the numerical results show the correctness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In recent years, the escalating risk of natural disasters caused by Near-Earth Objects (NEOs) has garnered heightened scrutiny, particularly in the aftermath of the 2013 Chelyabinsk event. This has prompted increased interest from governmental and supranational entities, leading to the formulation of various measures and strategies aimed at mitigating the potential threat posed by NEOs. This paper delves into the analysis of the 2011 AG5 asteroid within the context of small celestial bodies (e.g., asteroids, comets, or meteoroids) exhibiting resonant orbits with Earth's heliocentric revolution. Initial observations in 2011 raised alarms regarding the asteroid's orbital parameters, indicating a significant risk of Earth impact during its resonant encounter in 2040. Subsequent observations, however, mitigated these concerns. Here, we manipulate the orbital elements of the 2011 AG5 asteroid to simulate its behavior as a virtual impactor (a virtual asteroid whose orbit could impact Earth). This modification facilitates the assessment of impact mitigation resulting from a deflection maneuver utilizing a kinetic impactor. The deflection maneuver, characterized as an impulsive change in the asteroid's momentum, is executed during a resonant encounter occurring approximately two decades before the potential impact date. The paper systematically evaluates the dependence of the deflection maneuver's efficacy on critical parameters, including the position along the orbit, epoch, and momentum enhancement factor. [ABSTRACT FROM AUTHOR]

Deep learning technology has made significant progress in agricultural image recognition tasks, but the parameter adjustment of deep models usually requires a lot of manual intervention, which is time-consuming and inefficient. To solve this challenge, this paper proposes an adaptive parameter tuning strategy that combines sine–cosine algorithm with Tent chaotic mapping to enhance sea horse optimization, which improves the search ability and convergence stability of standard sea horse optimization algorithm (SHO). Through adaptive optimization, this paper determines the best parameter configuration in ResNet-50 neural network and optimizes the model performance. The improved ESHO algorithm shows superior optimization effects than other algorithms in various performance indicators. The improved model achieves 96.7% accuracy in the corn disease image recognition task, and 96.4% accuracy in the jade fungus image recognition task. These results show that ESHO can not only effectively improve the accuracy of agricultural image recognition, but also reduce the need for manual parameter adjustment. [ABSTRACT FROM AUTHOR]

This paper investigates the relationship between generalized orthogonality and Gâteaux derivative of the norm in a normed linear space. It is shown that the Gâteaux derivative of x in the y direction is zero when the norm is Gâteaux differentiable in the y direction at x and x and y satisfy certain generalized orthogonality conditions. A case where x and y are approximately orthogonal is also analyzed and the value range of the Gâteaux derivative in this case is given. Moreover, two concepts are introduced: the angle between vectors in normed linear space and the ⊥ Δ coordinate system in a smooth Minkowski plane. Relevant examples are given at the end of the paper. [ABSTRACT FROM AUTHOR]

On the basis of K. Kuratowski's definitions of a topological structure with a closure or interior operator, the concept of a modal topological structure (MTS) with one of these operators was introduced by the author. This new structure was illustrated with examples with intuitionistic fuzzy topological operators from both examples, and for this reason, these structures were named intuitionistic fuzzy MTSs (IFMTSs). In a series of papers, the author introduced some modifications and extensions to the IFMTSs, e.g., intuitionistic fuzzy temporal topological structures, intuitionistic fuzzy level topological structures and others, and intuitionistic fuzzy multi modal topological structures and others. In the present paper, four new examples of intuitionistic fuzzy multi modal topological structures are given. On their base, the concepts of a modal multi-topological structure and of a multi-modal multi-topological structure are introduced and illustrated with examples from the area of the intuitionistic fuzzy sets—intuitionistic fuzzy modal multi-topological structure with a closure or an interior operator; and intuitionistic fuzzy multi-modal multi-topological structure with one of these operators. Two intuitionistic fuzzy topological operators are defined. Their basic properties are studied and they are used in the new structures. [ABSTRACT FROM AUTHOR]

It is well known that in C [ X ] , the product of two polynomials is equal to the product of their greatest common divisor and their least common multiple. In a recent paper, we proved a similar relation between the ranks of matrix polynomials. More precisely, the sum of the ranks of two matrix polynomials is equal to the sum of the rank of the greatest common divisor of the polynomials applied to the respective matrix and the rank of the least common multiple of the polynomials applied to the respective matrix. In this paper, we present three new proofs for this result. In addition to these, we present two more applications. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the local and semilocal convergence of an iterative method for solving nonlinear systems of equations. We first establish the conditions under which these methods converge locally to the solution. Then, we extend our analysis to examine the semilocal convergence of these methods, considering their behavior when starting from initial guesses that are not necessarily close to the solution. Iterative approaches for solving nonlinear systems of equations must take into account the radius of convergence, computable upper error bounds, and the uniqueness of solutions. These points have not been addressed in earlier studies. Moreover, we provide numerical examples to demonstrate the theoretical findings and compare the performance of these methods under different circumstances. Finally, we conclude that our examination offers a significant understanding of the convergence characteristics of previous iterative techniques for solving nonlinear equation systems. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of sliding mode control for a class of hybrid switched systems with matching disturbances. Firstly, a sliding mode surface is designed, and the corresponding sliding mode equation for the switched system is derived. Then, we analyzed the stability of the sliding mode equation using the Lyapunov function and average dwell time. Moreover, a sliding mode control law is designed with the approach law method to drive the system state to a bounded sliding mode region and then maintain it there subsequently. Finally, an illustrative example is given to demonstrate the efficiency of the approach. [ABSTRACT FROM AUTHOR]

Predicting wind speed in advance at bridge sites is essential for ensuring bridge construction safety under high wind conditions. This study proposes a short-term speed prediction model based on outlier correction, Wavelet Denoising, the Osprey Optimization Algorithm (OOA), and the Transformer model. The outliers caused by data entry and measurement errors are processed by the interquartile range (IQR) method. By comparing the performance of four different wavelets, the best-performing wavelet (Bior2.2) was selected to filter out sharp noise from the data processed by the IQR method. The OOA-Transformer model was utilized to forecast short-term wind speeds based on the filtered time series data. With OOA-Transformer, the seven hyperparameters of the Transformer model were optimized by the Osprey Optimization Algorithm to achieve better performance. Given the outstanding performance of LSTM and its variants in wind speed prediction, the OOA-Transformer model was compared with six other models using the actual wind speed data from the Xuefeng Lake Bridge dataset to validate our proposed model. The experimental results show that the mean absolute percentage error (MAPE), root mean square error (RMSE), and coefficient of determination ( R 2 ) of this paper's method on the test set were 4.16%, 0.0152, and 0.9955, respectively, which are superior to the other six models. The prediction accuracy was found to be high enough to meet the short-term wind speed prediction needs of practical projects. [ABSTRACT FROM AUTHOR]

Microseismic data are widely employed for assessing rockburst risks; however, significant disparities exist in the monitoring capabilities of seismic networks across different mines, and none can capture a complete dataset of microseismic events. Such differences introduce unfairness when applying the same methodologies to evaluate rockburst risks in various mines. This paper proposes a method for assessing the monitoring capability of seismic networks applicable to heterogeneous media in mines. It achieves this by integrating three gradient boosting algorithms: Extreme Gradient Boosting (XGBoost), Light Gradient Boosting Machine (LightGBM), and Categorical Boosting (CatBoost). Initially, the isolation forest algorithm is utilized for preliminary data cleansing, and feature engineering is constructed based on the relative locations of event occurrences to monitoring stations and the working face. Subsequently, the optimal hyperparameters for three models are searched for using 8508 microseismic events from the a Coal Mine in eastern China as samples, and 18 sub-models are trained. Model weights are then determined based on the performance metrics of different algorithms, and an ensemble model is created to predict the monitoring capability of the network. The model demonstrated excellent performance on the training and test sets, achieving log loss, accuracy, and recall scores of 7.13, 0.81, and 0.76 and 6.99, 0.80, and 0.77, respectively. Finally, the method proposed in this study was compared with traditional approaches. The results indicated that, under the same conditions, the proposed method calculated the monitoring capability of the key areas to be 11% lower than that of the traditional methods. The reasons for the differences between these methods were identified and partially explained. [ABSTRACT FROM AUTHOR]

In this paper, we study the dynamics of the ratio-dependent type prey–predator model with different free boundaries. The two free boundaries, determined by prey and predator, respectively, implying that they may intersect with each other as time evolves, are used to describe the spreading of prey and predator. Our primary focus lies in analyzing the long-term behaviors of both predator and prey. We establish sufficient conditions for the spreading and vanishing of prey and predator. Furthermore, in cases where spread occurs, we offer estimates for the asymptotic spreading speeds of prey and predator, denoted as u and v, respectively, as well as the asymptotic speeds of the free boundaries, denoted by h and g. Our findings reveal that when the predator's speed is lower than that of the prey, it leads to a reduction in the prey's asymptotic speed. [ABSTRACT FROM AUTHOR]

This paper presents a novel fuzzy-augmented model reference adaptive voltage regulation strategy for the DC–DC buck converters to enhance their resilience against random input variations and load-step transients. The ubiquitous proportional-integral-derivative (PID) controller is employed as the baseline scheme, whose gains are tuned offline via a pre-calibrated linear-quadratic optimization scheme. However, owing to the inefficacy of the fixed-gain PID controller against parametric disturbances, it is retrofitted with a model reference adaptive controller that uses Lyapunov gain adaptation law for the online modification of PID gains. The adaptive controller is also augmented with an auxiliary fuzzy self-regulation system that acts as a superior regulator to dynamically update the adaptation rates of the Lyapunov gain adaptation law as a nonlinear function of the system's classical error and its normalized acceleration. The proposed fuzzy system utilizes the knowledge of the system's relative rate to execute better self-regulation of the adaptation rates, which in turn, flexibly steers the adaptability and response speed of the controller as the error conditions change. The propositions above are validated by performing tailored hardware experiments on a low-power DC–DC buck converter prototype. The experimental results validate the improved reference tracking and disturbance rejection ability of the proposed control law compared to the fixed PID controller. [ABSTRACT FROM AUTHOR]

This paper addresses the elliptic interface problem involving jump conditions across the interface. We propose a hybrid mixed finite element method on the triangulation where the interfaces are aligned with the mesh. The second-order elliptic equation is initially decomposed into two equations by introducing a gradient term. Subsequently, weak formulations are applied to these equations. Scheme continuity is enforced using the Lagrange multiplier technique. Finally, we derive an explicit formula for the entries of the matrix equation representing Lagrange multiplier unknowns resulting from hybridization. The method yields approximations of all variables, including the solution and gradient, with optimal order. Furthermore, the matrix representing the final linear algebra systems is not only symmetric but also positive definite. Numerical examples convincingly demonstrate the effectiveness of the hybrid mixed finite element method in addressing elliptic interface problems. [ABSTRACT FROM AUTHOR]

Chaotic or hyperchaotic systems have a significant role in engineering applications such as cryptography and secure communication, serving as primary signal generators. To ensure stronger complexity, memristors with sufficient nonlinearity are commonly incorporated into the system, suffering a limitation on the physical implementation. In this paper, we propose a new four-dimensional (4D) hyperchaotic system based on the linear memristor which is the most straightforward to implement physically. Through numerical studies, we initially demonstrate that the proposed system exhibits robust hyperchaotic behaviors under typical parameter conditions. Subsequently, we theoretically prove the existence of solid hyperchaos by combining the topological horseshoe theory with computer-assisted research. Finally, we present the realization of the proposed hyperchaotic system using an FPGA platform. This proposed system possesses two key properties. Firstly, this work suggests that the simplest memristor can also induce strong nonlinear behaviors, offering a new perspective for constructing memristive systems. Secondly, compared to existing systems, our system not only has the largest Kaplan-Yorke dimension, but also has clear advantages in areas related to engineering applications, such as the parameter range and signal bandwidth, indicating promising potential in engineering applications. [ABSTRACT FROM AUTHOR]

In this paper, for a wide class of nonparametric regression models, new local linear kernel estimators are proposed that are uniformly consistent under close-to-minimal and visual conditions on design points. These estimators are universal in the sense that their designs can be either fixed and not necessarily satisfying the traditional regularity conditions, or random, while not necessarily consisting of independent or weakly dependent random variables. With regard to the design elements, only dense filling of the regression function domain with the design points without any specification of their correlation is assumed. This study extends the dense data methodology and main results of the authors' previous work for the case of regression functions of several variables. [ABSTRACT FROM AUTHOR]

In this paper, we study the improved block splitting (IBS) iteration method and its accelerated variant, the accelerated improved block splitting (AIBS) iteration method, for solving linear systems of equations stemming from the discretization of the complex Helmholtz equation. We conduct a comprehensive convergence analysis and derive optimal iteration parameters aimed at minimizing the spectral radius of the iteration matrix. Through numerical experiments, we validate the efficiency of both iteration methods. [ABSTRACT FROM AUTHOR]

In this paper, we discuss the statistical inference of interval-censored recurrence event data under an informative observation process. We establish an additive semiparametric mean model for the recurrence event process. Since the observation process may contain relevant information about potential underlying recurrence event processes, which leads to confounding bias, therefore, we introduced a propensity score into the additive semiparametric mean model to adjust for confounding bias, which possibly exists. Furthermore, the estimation equations were used to estimate the parameters of the covariate effects, and the asymptotic normality of the estimator under large samples is proven. Through simulation studies, we illustrated that the proposed method works well, and it was applied to the analysis of bladder cancer data. [ABSTRACT FROM AUTHOR]

The 360 degree feedback evaluation method is a multidimensional, comprehensive assessment method. Evaluators may hesitate among multiple evaluation values and be simultaneously constrained by the biases and cognitive errors of the evaluators, evaluation results are prone to unfairness and conflicts. To overcome these issues, this paper proposes a consensus-based 360 degree feedback evaluation method with linguistic distribution assessments. Firstly, evaluators provide evaluation information in the form of linguistic distribution. Secondly, utilizing an enhanced ordered weighted averaging (OWA) operator, the model aggregates multi-source evaluation information to handle biased evaluation information effectively. Subsequently, a consensus-reaching process is established to coordinate conflicting viewpoints among the evaluators, and a feedback adjustment mechanism is designed to guide evaluators in refining their evaluation information, facilitating the attainment of a unanimous evaluation outcome. Finally, the improved 360 degree feedback evaluation method was applied to the performance evaluation of the project leaders in company J, thereby validating the effectiveness and rationality of the method. [ABSTRACT FROM AUTHOR]

Feature detection and matching is the key technique for remote sensing image processing and related applications. In this paper, a PDE-constrained optimization model is proposed to determine the scale levels advantageous for feature detection. A variance estimation technique is introduced to treat the observation optical images polluted by additive zero-mean Gaussian noise and determine the parameter of a nonlinear scale space governed by the partial differential equation. Additive Operator Splitting is applied to efficiently solve the PDE constraint, and an iterative algorithm is proposed to approximate the optimal subset of the original scale level set. The selected levels are distributed more uniformly in the total variation sense and helpful for generating more accurate and robust feature points. The experimental results show that the proposed method can achieve about a 30% improvement in the number of correct matches with only a small increase in time cost. [ABSTRACT FROM AUTHOR]

Benchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range R, and these instances can be referred to as the unbounded knapsack problem with bounded coefficients (UKPB). In order to increase the difficulty of solving these instances, the knapsack capacity C is usually set to a very large value. While current efficient algorithms primarily center on the Fast Fourier Transform (FFT) and (min,+)-convolution method, there is a simpler method worth considering. In this paper, based on the basic Unbounded-DP algorithm, we utilize a recent branch and bound (B&B) result and basic theory of linear Diophantine equation, and propose an improved Unbounded-DP algorithm with time complexity of O (R 4) and space complexity of O (R 3) . Additionally, the algorithm can also solve the All-capacities unbounded knapsack problem within the complexity O (R 4 + C) . In particular, the proof techniques required by the algorithm are primarily covered in the first-year mathematics curriculum, which is convenient for subsequent researchers to grasp. [ABSTRACT FROM AUTHOR]

In industries such as aircraft or train manufacturing, large-scale manufacturing companies often manage several complex projects. Each of these projects includes multiple tasks that share a set of limited resources. Typically, these tasks are also subject to time dependencies among them. One frequent goal in these scenarios is to minimize the makespan, or total time required to complete all the tasks within the entire project. Decisions revolve around scheduling these tasks, determining the sequence in which they are processed, and allocating shared resources to optimize efficiency while respecting the time dependencies among tasks. This problem is known in the scientific literature as the Resource-Constrained Project Scheduling Problem (RCPSP). Being an NP-hard problem with time dependencies and resource constraints, several optimization algorithms have already been proposed to tackle the RCPSP. In this paper, a novel discrete-event heuristic is introduced and later extended into an agile biased-randomized algorithm complemented with an adaptive capability to tune the parameters of the algorithm. The results underscore the effectiveness of the algorithm in finding competitive solutions for this problem within short computing times. [ABSTRACT FROM AUTHOR]

The paper expands the finite difference method to the complex plane, and thus obtains an improvement in the resolution of differential equations with an increase in numerical precision and a generalization in the mathematical modeling of problems. The article begins with a selection of the best techniques for obtaining finite difference coefficients for approximating derivatives in the real domain. Then, the calculation is expanded to the complex domain. The research expands forward, backward, and central difference approximations of the real case by a quadrant approximation in the complex plane, which facilitates the use in boundary conditions of differential equations. The article shows many real and complex finite difference equations with their respective order of error, intended to serve as a basis and reference, which have been tested in practical examples of solving differential equations used in engineering. Finally, a comparison is made between the real and complex techniques of finite difference methods applied in the Theory of Elasticity. As a surprising result, the article shows that the finite difference method has great advantages in numerical precision, diversity of formulas, and modeling generalities in the complex domain when compared to the real domain. [ABSTRACT FROM AUTHOR]

In this paper, we solve the open problem posed by Kuba by expressing ∑ j , k ≥ 1 H k (u) H j (v) H j + k (w) j r k s (j + k) t as a linear combination of multiple zeta values. These sums include Tornheim's double series as a special case. Our approach is based on employing two distinct methods to evaluate the specific integral proposed by Yamamoto, which is associated with the two-poset Hasse diagram. We also provide a new evaluation formula for the general Mordell–Tornheim series and some similar types of double and triple series. [ABSTRACT FROM AUTHOR]

The straightness control of a fully mechanized working face is the key technology used in intelligent coal mining, so the position control of a hydraulic support multi-cylinder moving system is of great significance. However, due to the harsh environment of coal mines, complex friction, external disturbances, and the coupling relationship between adjacent cylinders, the accuracy of position control is restricted. Therefore, an output cooperative controller is proposed in this paper for a multi-cylinder system. A high-order sliding mode observer is utilized to estimate the system states with the only available output position signal. A neural network disturbance observer is applied to estimate the lump disturbance of the strict-feedback model, including the system uncertainty, disturbance force and the coupling force between adjacent cylinders. Then, continuous motion position tracking simulation is conducted and the estimation performance of the state observer and neural network is analyzed. Furthermore, a multi-cylinder collaborative control test rig is designed, and experiments based on the actual actions of the hydraulic support are conducted. The results show that the proposed output cooperative controller has an excellent position control performance compared with the traditional proportional–integral controller. [ABSTRACT FROM AUTHOR]

This paper addresses the almost sure convergence and the asymptotic normality of an estimator of the multidimensional renewal function based on random fields. The estimator is based on a sequence of non-negative independent and identically distributed (i. i. d.) multidimensional random fields and is expressed as infinite sums of k -folds convolutions of the empirical distribution function. It is an extension of the work from the case of the two-dimensional random fields to the case of the d -dimensional random fields where d > 2 . This is established by the definition of a "strict order relation". Concrete applications are given. [ABSTRACT FROM AUTHOR]