Search

In an era overwhelmed by academic big data, students grapple with identifying academic papers that resonate with their learning objectives and research interests, due to the sheer volume and complexity of available information. This study addresses the challenge by proposing a novel academic paper recommendation system designed to enhance personalized learning through the nuanced understanding of academic social networks. Utilizing the theory of social homogeneity, the research first constructs a sophisticated academic social network, capturing high-order social relationships, such as co-authorship and advisor–advisee connections, through hypergraph modeling and advanced network representation learning techniques. The methodology encompasses the development and integration of a hypergraph convolutional neural network and a contrastive learning framework to accurately model and recommend academic papers, focusing on aligning with students' unique preferences and reducing reliance on sparse interaction data. The findings, validated across multiple real-world datasets, demonstrate a significant improvement in recommendation accuracy, particularly in addressing the cold-start problem and effectively mapping advisor–advisee relationships. The study concludes that leveraging complex academic social networks can substantially enhance the personalization and precision of academic paper recommendations, offering a promising avenue for addressing the challenges of academic information overload and fostering more effective personalized learning environments. [ABSTRACT FROM AUTHOR]

In this paper, we consider and study in detail the generalized Fox–Wright function Ψ ˜ q p introduced in our recent work as an extension of the Fox–Wright function Ψ q p . This special function can be seen as an important case of the so-called I-functions of Rathie and H ¯ -functions of Inayat-Hussain, that in turn extend the Fox H-functions and appear to include some Feynman integrals in statistical physics, in polylogarithms, in Riemann Zeta-type functions and in other important mathematical functions. Depending on the parameters, Ψ ˜ q p is an entire function or is analytic in an open disc with a final radius. We derive its basic properties, such as its order and type, and its images under the Laplace transform and under classical fractional-order integrals. Particular cases of Ψ ˜ q p are specified, including the Mittag-Leffler and Le Roy-type functions and their multi-index analogues and many other special functions of Fractional Calculus. The corresponding results are illustrated. Finally, we emphasize the role of these new generalized hypergeometric functions as eigenfunctions of operators of new Fractional Calculus with specific I-functions as singular kernels. This paper can be considered as a natural supplement to our previous surveys "Going Next after 'A Guide to Special Functions in Fractional Calculus': A Discussion Survey", and "A Guide to Special Functions of Fractional Calculus", published recently in this journal. [ABSTRACT FROM AUTHOR]

This paper develops the mathematical apparatus of studying control problems for the stationary model of magnetic hydrodynamics of viscous heat-conducting fluid in the Boussinesq approximation. These problems are formulated as problems of conditional minimization of special cost functionals by weak solutions of the original boundary value problem. The model under consideration consists of the Navier–Stokes equations, the Maxwell equations without displacement currents, the generalized Ohm's law for a moving medium and the convection-diffusion equation for temperature. These relations are nonlinearly connected via the Lorentz force, buoyancy force in the Boussinesq approximation and convective heat transfer. Results concerning the existence and uniqueness of the solution of the original boundary value problem and of its generalized linear analog are presented. The global solvability of the control problem under study is proved and the optimality system is derived. Sufficient conditions on the data are established which ensure local uniqueness and stability of solutions of the control problems under study with respect to small perturbations of the cost functional to be minimized and one of the given functions. We stress that the unique stability estimates obtained in the paper have a clear mathematical structure and intrinsic beauty. [ABSTRACT FROM AUTHOR]

In this paper, we collect the basic information data of online rumors and highly topical public opinions. In the research of the propagation model of online public opinion rumors, we use the improved SCIR model to analyze the characteristics of online rumor propagation under the suspicion mechanism at different propagation stages, based on considering the flow of rumor propagation. We analyze the stability of the evolution of rumor propagation by using the time-delay differential equation under the punishment mechanism. In this paper, the evolution of heterogeneous views with different acceptance and exchange thresholds is studied, using the standard Deffuant model and the improved model under the influence of the media, to analyze the evolution process and characteristics of rumor opinions. Based on the above results, it is found that improving the recovery rate is better than reducing the deception rate, and increasing the eviction rate is better than improving the detection rate. When the time lag τ < 110, it indicates that the spread of rumors tends to be asymptotic and stable, and the punishment mechanism can reduce the propagation time and the maximum proportion of deceived people. The proportion of deceived people increases with the decrease in the exchange threshold, and the range of opinion clusters increases with the decline in acceptance. [ABSTRACT FROM AUTHOR]

Nowadays, accurate and efficient short-term traffic flow forecasting plays a critical role in intelligent transportation systems (ITS). However, due to the fact that traffic flow is susceptible to factors such as weather and road conditions, traffic flow data tend to exhibit dynamic uncertainty and nonlinearity, making the construction of a robust and reliable forecasting model still a challenging task. Aiming at this nonlinear and complex traffic flow forecasting problem, this paper constructs a short-term traffic flow forecasting hybrid optimization model, SSA-ELM, based on extreme learning machine by embedding the sparrow search algorithm in order to solve the above problem. Extreme learning machine has been widely used in short-term traffic flow forecasting due to its characteristics such as low computational complexity and fast learning speed. By using the sparrow search algorithm to optimize the input weight values and hidden layer deviations in the extreme learning machine, the sparrow search algorithm is utilized to search for the global optimal solution while taking into account the original characteristics of the extreme learning machine, so that the model improves stability while increasing prediction accuracy. Experimental results on the Amsterdam A10 road traffic flow dataset show that the traffic flow forecasting model proposed in this paper has higher forecasting accuracy and stability, revealing the potential of hybrid optimization models in the field of short-term traffic flow forecasting. [ABSTRACT FROM AUTHOR]

In order to reduce pollution caused by ship emissions, the International Maritime Organization (IMO) implemented sulfur emission control areas (SECAs). In comparison to ordinary vessels, cruise ships with dual attributes of transportation and tourism generate a greater amount of marine pollution, which poses a significant threat to the marine environment in both berthing ports and the sailing area. In light of the fierce competition of the cruise tourism market, cruise lines are looking for strategies, such as designing more attractive cruise routes, to maintain their core competencies under the emission control policy. In order to achieve this goal, this paper presents a mixed-integer non-linear programming (MINP) model with two objectives and is derived from the traditional route optimization problem. The primary objective is to optimize the route and speed of a cruise liner, while simultaneously enhancing route competitiveness and minimizing carbon emissions both within and outside the SECAs. Subsequently, the multi-objective particle swarm optimization (MOPSO) algorithm was used to reach the objective, and simulations were carried out to verify the effectiveness of the model and method. The results show that speed and sailing route optimization can affect carbon emissions. This paper has a certain application value and guiding significance for cruise line decision makers that will be beneficial for the environment. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of the adaptive neural network tracking control of nonlinear cyber–physical systems (CPSs) subject to unknown deception attacks with prescribed performance. The considered system is under the influence of unknown deception attacks on both actuator and sensor networks, making the research problem challenging. The outstanding contribution of this paper is that a new anti-deception attack-prescribed performance tracking control scheme is proposed through a special coordinate transformation and funnel function, combined with backstepping and bounded estimation methods. The transient performance of the system can be ensured by the prescribed performance control scheme, which makes the indicators of the controlled system, such as settling time and tracking accuracy, able to be pre-assigned offline according to the task needs, and the applicability of the prescribed performance is tested by selecting different values of the settling time (0.5 s, 1 s, 1.5 s, 2 s, 2.5 s, and 3 s). In addition, to save the computational and communication resources of the CPS, this paper uses a finite-time differentiator to approximate the virtual control law differentiation to avoid "complexity explosion" and a switching threshold event triggering mechanism to save the communication resources for data transmission. Finally, the effectiveness of the proposed control strategy is further verified by an electromechanical system simulation example. [ABSTRACT FROM AUTHOR]

In order to fulfill the practical application demands of precisely localizing underwater vehicles using passive electric field localization technology, we propose a scalar-potential-based method for the passive electric field localization of underwater vehicles. This method is grounded on an intelligent differential evolution algorithm and is particularly suited for use in three-layer and stratified oceanic environments. Firstly, based on the potential distribution law of constant current elements in a three-layer parallel stratified ocean environment, the mathematical positioning model is established using the mirror method. Secondly, the differential evolution (DE) algorithm is enhanced with a parameter-adaptive strategy and a boundary mutation processing mechanism to optimize the key objective function in the positioning problem. Additionally, the simulation experiments of the current element in the layered model prove the effectiveness of the proposed positioning method and show that it has no special requirements for the sensor measurement array, but the large range and moderate number of sensors are beneficial to improve the positioning effect. Finally, the laboratory experiments on the positioning method proposed in this paper, involving underwater simulated current elements and underwater vehicle tracks, were carried out successfully. The results indicate that the positioning method proposed in this paper can achieve the performance requirements of independent initial value, strong anti-noise capabilities, rapid positioning speed, easy implementation, and suitability in shallow sea environments. These findings suggest a promising practical application potential for the proposed method. [ABSTRACT FROM AUTHOR]

This paper is devoted to the study of the multi-dimensional integral transform with the Fox H-function in the kernel in weighted spaces with integrable functions in the domain R + n with positive coordinates. Due to the generality of the Fox H-function, many special integral transforms have the form studied in this paper, including operators with such kernels as generalized hypergeometric functions, classical hypergeometric functions, Bessel and modified Bessel functions and so on. Moreover, most important fractional integral operators, such as the Riemann–Liouville type, are covered by the class under consideration. The mapping properties in Lebesgue-weighted spaces, such as the boundedness, the range and the representations of the considered transformation, are established. In special cases, it is applied to the specific integral transforms mentioned above. We use a modern technique based on the extensive use of the Mellin transform and its properties. Moreover, we generalize our own previous results from the one-dimensional case to the multi-dimensional one. The multi-dimensional case is more complex and needs more delicate techniques. [ABSTRACT FROM AUTHOR]

The applicability of the distance aggregation problem has attracted the interest of many authors. Motivated by this fact, in this paper, we face the modular quasi-(pseudo-)metric aggregation problem, which consists of analyzing the properties that a function must have to fuse a collection of modular quasi-(pseudo-)metrics into a single one. In this paper, we characterize such functions as monotone, subadditive and vanishing at zero. Moreover, a description of such functions in terms of triangle triplets is given, and, in addition, the relationship between modular quasi-(pseudo-)metric aggregation functions and modular (pseudo-)metric aggregation functions is discussed. Specifically, we show that the class of modular (quasi-)(pseudo-)metric aggregation functions coincides with that of modular (pseudo-)metric aggregation functions. The characterizations are illustrated with appropriate examples. A few methods to construct modular quasi-(pseudo-)metrics are provided using the exposed theory. By exploring the existence of absorbent and neutral elements of modular quasi-(pseudo-)metric aggregation functions, we find that every modular quasi-pseudo-metric aggregation function with 0 as the neutral element is an Aumann function, is majored by the sum and satisfies the 1-Lipschitz condition. Moreover, a characterization of those modular quasi-(pseudo-)metric aggregation functions that preserve modular quasi-(pseudo-)metrics is also provided. Furthermore, the relationship between modular quasi-(pseudo-)metric aggregation functions and quasi-(pseudo-)metric aggregation functions is studied. Particularly, we have proven that they are the same only when the former functions are finite. Finally, the usefulness of modular quasi-(pseudo-)metric aggregation functions in multi-agent systems is analyzed. [ABSTRACT FROM AUTHOR]

Geary's c is a prominent measure of spatial autocorrelation in univariate spatial data. It uses a weighted sum of squared differences. This paper develops Geary's c for multivariate spatial data. It can describe the similarity/discrepancy between vectors of observations at different vertices/spatial units by a weighted sum of the squared Euclidean norm of the vector differences. It is thus a natural extension of the univariate Geary's c. This paper also develops a local version of it. We then establish their properties. [ABSTRACT FROM AUTHOR]

The question of whether there is a true isometry that approximates the ε -isometry defined on a bounded set has long interested mathematicians. The first paper on this topic was published by Fickett, whose result was subsequently greatly improved by Alestalo et al., Väisälä and Vestfrid. Recently, the authors published some papers improving the previous results. The main purpose of this paper is to improve all of the abovementioned results by utilizing the properties of the norm and inner product for Euclidean space. [ABSTRACT FROM AUTHOR]

The rapid development of supply chain finance (SCF) has significantly alleviated the financing difficulties of small and medium-sized enterprises (SMEs). However, it is important to recognize that within the accounts receivable financing segment of the SCF credit market, the credit risk associated with SMEs poses a serious challenge and potential threat to the stability, health, and sustainable development of the SCF system. This paper pays special attention to the stability of the two-party evolutionary game between SMEs and financial institutions (FIs) within the context of the Chinese SCF credit market. To identify a pathway to reduce credit risks for SMEs while simultaneously enhancing system stability, this paper adopts the stochastic evolutionary game (SEG) model and combines the fixed-point method to determine the conditions that satisfy the stability of the system's index p mean square of the system. This study has made attempts in various aspects, such as the innovative construction and investigation of a nonlinear SEG model, the endeavor to study the stability of SEG systems using fixed-point methods, and the innovative construction of a more realistic two-player SEG system. The data and simulation results generated from hypothetical scenarios show that the conclusions of the article are credible and feasible. Through the study, we conclude that the higher credit ratio from FI and the higher penalty intensity from core enterprises (CEs) will accelerate the stability of the system. Based on solid data and modeling analysis, insights into the regulation of FI are provided. [ABSTRACT FROM AUTHOR]

This document is a summary of a special issue of the journal "Mathematics" that focuses on new trends in complex analysis research. The issue includes 14 papers that cover various aspects of complex-valued functions of one or several complex variables. The papers explore topics such as coefficient estimates, starlikeness and convexity of analytic functions, holomorphic and bi-univalent functions, and integral operators. The research presented in the papers aims to contribute to the development of complex analysis and inspire further studies in the field. The document also acknowledges the authors and reviewers who contributed to the special issue's success. [Extracted from the article]

This paper explores the integrated optimization of complex coupled industrial manufacturing systems and production strategies based on user customization needs. Two optimization metrics are considered: one is whether the production process of engineering manufacturing is simplified, and the other is whether it is based on the customization requirements of the customer. These two metrics are interrelated, and cases may even be conflicting. Considering the interdependence between engineering manufacturing and user requirements, this paper develops an integrated customized modular engineering manufacturing process to minimize production and maintenance costs and improve efficiency while meeting user customization requirements. This paper takes expert evaluation as an important decision indicator and optimizes the production process strategy on this basis. Finally, a case study is given to illustrate the applicability of the proposed process model. [ABSTRACT FROM AUTHOR]

Large-scale particle swarm optimization (PSO) has long been a hot topic due to the following reasons: Swarm diversity preservation is still challenging for current PSO variants for large-scale optimization problems, resulting in difficulties for PSO in balancing its exploration and exploitation. Furthermore, current PSO variants for large-scale optimization problems often introduce additional operators to improve their ability in diversity preservation, leading to increased algorithm complexity. To address these issues, this paper proposes a dual-competition-based particle update strategy (DCS), which selects the particles to be updated and corresponding exemplars with two rounds of random pairing competitions, which can straightforwardly benefit swarm diversity preservation. Furthermore, DCS confirms the primary and secondary exemplars based on the fitness sorting operation for exploitation and exploration, respectively, leading to a dual-competition-based swarm optimizer. Thanks to the proposed DCS, on the one hand, the proposed algorithm is able to protect more than half of the particles from being updated to benefit diversity preservation at the swarm level. On the other hand, DCS provides an efficient exploration and exploitation exemplar selection mechanism, which is beneficial for balancing exploration and exploitation at the particle update level. Additionally, this paper analyzes the stability conditions and computational complexity of the proposed algorithm. In the experimental section, based on seven state-of-the-art algorithms and a recently proposed large-scale benchmark suite, this paper verifies the competitiveness of the proposed algorithm in large-scale optimization problems. [ABSTRACT FROM AUTHOR]

Convolutional Neural Networks (CNNs) are a kind of artificial neural network designed to extract features and find out patterns for tasks such as segmentation, recognizing objects, and drawing up classification. Within a CNNs architecture, pooling operations are used until the number of parameters and the computational complexity are reduced. Numerous papers have focused on investigating the impact of pooling on the performance of Convolutional Neural Networks (CNNs), leading to the development of various pooling models. Recently, a fuzzy pooling operation based on type-1 fuzzy sets was introduced to cope with the local imprecision of the feature maps. However, in fuzzy set theory, it is not always accurate to assume that the degree of non-membership of an element in a fuzzy set is simply the complement of the degree of membership. This is due to the potential existence of a hesitation degree, which implies a certain level of uncertainty. To overcome this limitation, intuitionistic fuzzy sets (IFS) were introduced to incorporate the concept of a degree of hesitation. In this paper, we introduce a novel pooling operation based on intuitionistic fuzzy sets to incorporate the degree of hesitation heretofore neglected by a fuzzy pooling operation based on classical fuzzy sets, and we investigate its performance in the context of image classification. Intuitionistic pooling is performed in four steps: bifuzzification (by the transformation of data through the use of membership and non-membership maps), first aggregation (through the transformation of the IFS into a standard fuzzy set, second aggregation (through the transformation and use of a sum operator), and the defuzzification of feature map neighborhoods by using a max operator. IFS pooling is used for the construction of an intuitionistic pooling layer that can be applied as a drop-in replacement for the current, fuzzy (type-1) and crisp, pooling layers of CNN architectures. Various experiments involving multiple datasets demonstrate that an IFS-based pooling can enhance the classification performance of a CNN. A benchmarking study reveals that this significantly outperforms even the most recent pooling models, especially in stochastic environments. [ABSTRACT FROM AUTHOR]

Predicting breakthrough papers holds great significance; however, prior studies encountered challenges in this task, indicating a need for substantial improvement. We propose that the failure to capture the dynamic structural-evolutionary features of citation networks is one of the major reasons. To overcome this limitation, this paper introduces a new method for constructing citation cascades of focus papers, allowing the creation of a time-series-like set of citation cascades. Then, through a thorough review, three types of structural indicators in these citation networks that could reflect breakthroughs are identified, including certain basic topological metrics, PageRank values, and the von Neumann graph entropy. Based on the time-series-like set of citation cascades, the dynamic trajectories of these indicators are calculated and employed as predictors. Using the Nobel Prize-winning papers as a landmark dataset, our prediction method yields approximately a 7% improvement in the ROC-AUC score compared to static-based prior methods. Additionally, our method advances in achieving earlier predictions than other previous methods. The main contribution of this paper is proposing a novel method for creating citation cascades in chronological order and confirming the significance of predicting breakthroughs from a dynamic structural perspective. [ABSTRACT FROM AUTHOR]

The main objective of this paper is to reduce the dimensionality of unknown coefficient vectors of finite-element (FE) solutions in two-grid (CN) FE (TGCNFE) format for the nonlinear unsaturated soil water flow problem by using a proper orthogonal decomposition (POD) and to design a new reduced-dimension iteration TGCNFE (RDITGCNFE). For this objective, a new time semi-discrete CN (TSDCN) scheme for the nonlinear unsaturated soil water flow problem is first designed and the existence, stability, and error estimates of TSDCN solutions are demonstrated. Subsequently, a new TGCNFE format for the nonlinear unsaturated soil water flow problem is designed and the existence, unconditional stability, and error estimates of TGCNFE solutions are demonstrated. Next, a new RDITGCNFE format with the same FE basis functions as the TGCNFE format is built by the POD method and the existence, unconditional stability, and error estimates of RDITGCNFE solutions are discussed. Ultimately, the rightness of theory results and the superiority of the RDITGCNFE format are verified by two sets of numerical tests. It is worth noting that the RDITGCNFE format differs completely from all previous reduced-dimension methods, including the authors' previous works. Therefore, the study of this paper can not only provide a new theoretical method for the dimensionality reduction of numerical models for nonlinear problems but also provide an algorithm implementation technology for the numerical simulation of practical engineering problems. [ABSTRACT FROM AUTHOR]

This paper investigates the bumpless transfer control of linear switched positive systems based on state and disturbance observers. First, state and disturbance observers are designed for linear switched positive systems to estimate the state and the disturbance. By combining the designed state observer, the disturbance observer, and the output, a new controller is constructed for the systems. All gain matrices are described in the form of linear programming. By using co-positive Lyapunov functions, the positivity and stability of the closed-loop system can be ensured. In order to achieve the bumpless transfer property, some additional sufficient conditions are imposed on the control conditions. The novelties of this paper lie in that (i) a novel framework is presented for positive disturbance observer, (ii) double observers are constructed for linear switched positive systems, and (iii) a bumpless transfer controller is proposed in terms of linear programming. Finally, two examples are given to illustrate the effectiveness of the proposed results. [ABSTRACT FROM AUTHOR]

The real-time sharing of traffic data can offer improved services to users and timely respond to environmental changes. However, this data often involves individuals' sensitive information, raising substantial privacy concerns. It is imperative to find ways to protect the privacy of the shared traffic data while maintaining its ongoing data utility. In this paper, a Differential Privacy-based scheme with Spatial Correlation for Real-time traffic data (named as DP-SCR) is proposed. DP-SCR not only ensures the high data utility of shared traffic data, but also provides strong privacy protection. Specifically, DP-SCR is designed to adhere to w-event ε -differential privacy, ensuring a high level of privacy protection. Subsequently, a novel adaptive allocation based on spatial correlation prediction is proposed to optimize the privacy budget allocation in differential privacy. In addition, a feasible dynamic clustering algorithm is developed to minimize the relative perturbation error, which further improves the quality of shared data. Finally, the analyses demonstrate that DP-SCR provides w-event privacy for the shared data of each section, and the spatial correlation is a more pronounced characteristic of the traffic data than other characteristics. Meanwhile, experiments conducted on real-world data show that the MAR and MER of the predicted data in DP-SCR are smaller than those in other baseline DP-based schemes. It indicates that the DP-SCR scheme proposed in this paper can provide more accurate shared data. [ABSTRACT FROM AUTHOR]

Mission scheduling is an essential function of the management control of remote-sensing satellite application systems. With the continuous development of remote-sensing satellite applications, mission scheduling faces significant challenges. Existing work has many inherent shortcomings in dealing with dynamic task scheduling for remote-sensing satellites. In high-load and complex remote sensing task scenarios, there is low scheduling efficiency and a waste of resources. The paper proposes a scheduling method for remote-sensing satellite applications based on dynamic task prioritization. This paper combines the and Bound methodologies with an onboard task queue scheduling band in an active task prioritization context. A purpose-built emotional task priority-based scheduling blueprint is implemented to mitigate the flux and unpredictability characteristics inherent in the traditional satellite scheduling paradigm, improve scheduling efficiency, and fine-tune satellite resource allocation. Therefore, the Branch and Bound method in remote-sensing satellite task scheduling will significantly save space and improve efficiency. The experimental results show that comparing the technique to the three heuristic algorithms (GA, PSO, DE), the BnB method usually performs better in terms of the maximum value of the objective function, always finds a better solution, and reduces about 80% in terms of running time. [ABSTRACT FROM AUTHOR]

This paper proposes an improved dual-center particle swarm optimization (IDCPSO) algorithm which can effectively improve some inherent defects of particle swarm optimization algorithms such as being prone to premature convergence and low optimization accuracy. Based on the in-depth analysis of the velocity updating formula, the most innovative feature is the vectorial decomposition of the velocity update formula of each particle to obtain three different flight directions. After combining these three directions, six different flight paths and eight intermediate positions can be obtained. This method allows the particles to search for the optimal solution in a wider space, and the individual extreme values are greatly improved. In addition, in order to improve the global extreme value, it is designed to construct the population virtual center and the optimal individual virtual center by using the optimal position and the current position searched by the particle. Combining the above strategies, an adaptive mutation factor that accumulates the coefficient of mutation according to the number of iterations is added to make the particle escape from the local optimum. By running the 12 typical test functions independently 50 times, the results show an average improvement of 97.9% for the minimum value and 97.7% for the average value. The IDCPSO algorithm in this paper is better than other improved particle swarm optimization algorithms in finding the optimum. [ABSTRACT FROM AUTHOR]

Credit risk assessment is an important process in bank financial risk management. Traditional machine-learning methods cannot solve the problem of data islands and the high error rate of two-way decisions, which is not conducive to banks' accurate credit risk assessment of users. To this end, this paper establishes a federated three-way decision incremental naive Bayes bank user credit risk assessment model (FTwNB) that supports asymmetric encryption, uses federated learning to break down data barriers between banks, and uses asymmetric encryption to protect data security for federated processes. At the same time, the model combines the three-way decision methods to realize the three-way classification of user credit (good, bad and delayed judgment), so as to avoid the loss of bank interests caused by the forced division of uncertain users. In addition, the model also incorporates incremental learning steps to eliminate training samples with poor data quality to further improve the model performance. This paper takes German Credit data and Default of Credit Card Clients data as examples to conduct simulation experiments. The result shows that the performance of the FTwNB model has been greatly improved, which verifies that it has good credit risk assessment capabilities. [ABSTRACT FROM AUTHOR]

An acceptance sampling plan is a method used to make a decision about acceptance or rejection of a product based on adherence to a standard. Meanwhile, prior information, such as the process capability index (PCI), has been applied in different manufacturing industries to improve the quality of manufacturing processes and the quality inspection of products. In this paper, an attribute sampling plan is developed for submitted lots based on prior information and Bayesian approach. The new attribute sampling plans adjust sample sizes to prior information based on the status of the inspection target. To be specific, the sampling plans in this paper are indexed by the parameter trust with levels of low, medium, and high, where increasing trust level reduces sample size or risk. PCIs are an important basis for the choice of the trust level. In addition, multiple comparisons have been performed, including producer's risk and consumer's risk under different prior information parameters and different sample sizes. [ABSTRACT FROM AUTHOR]

Health status detection for motor drive systems includes detecting the working status of the motor and diagnosing open-circuit (OC) faults in the inverter. This paper proposes a generalized-layer-added principle component analysis (GPCA) to determine the load-up/load-shedding status of a motor and diagnose faults in its inverter. Most current methods for detecting OC faults are constrained by changes in the current amplitude and frequency, potentially leading to misjudgments during load-up/load-shedding transient states. The proposed method addresses this issue. Initially, this paper employs a homogenization method to process current data, eliminating the impact of transient processes during motor load-up/load-shedding states on inverter fault diagnosis. Subsequently, the fast Fourier transform (FFT) is used to extract the frequency domain characteristics of the data. If the PCA method is trained with a singular matrix, this can lead to an unreliable result. This paper introduces a generalization layer based on the PCA method, leading to the GPCA method, which enables training with singular matrices. The GPCA method is then developed to compute data features. By presetting thresholds and utilizing the prediction error value and contribution rate index of the GPCA method, the relevant state of the motor drive system can be determined. Finally, through simulations and experiments, it has been demonstrated that the method, using data from the stable working state, can effectively detect the working status of a motor and diagnose OC faults in its inverter, with a diagnostic time of 0.05 current cycles. [ABSTRACT FROM AUTHOR]

The issues of the evaluation and prediction of the reliability and testability of mining machinery and equipment are becoming particularly relevant, since the safety of technological processes and human life is reaching a new level of realisation due to changes in mining technology. The work is devoted to the development of a logical model for analysing the controllability of mining equipment. The paper presents a model of reliability of the operation of mining equipment on the example of a mine load and passenger hoist. This generalised model is made in the form of a graph of transitions and supplemented with a system of equations. The model allows for the estimation of the reliability of equipment elements and equipment as a whole. A mathematical and logical model for the calculation of the availability and downtime coefficients of various designs of mining equipment systems is proposed. This model became the basis for the methods to calculate the optimal values of diagnostic depth. At these calculated values, the maximum value of availability factor will be obtained. In this paper, an analytical study was carried out and dependences of the readiness factor of parameters of the investigated system such as the intensity of control of technical systems, intensity of failures, etc., were constructed. The paper proposes a mathematical model to assess the reliability of mine hoisting plants through its integration into the method of improving the reliability of mine hoisting plants. [ABSTRACT FROM AUTHOR]

This paper explores the likelihood and Bayesian estimation of the stress–strength reliability parameter (R) based on a lower record ranked set sampling scheme from the generalized Rayleigh distribution. Maximum likelihood and Bayesian estimators as well as confidence intervals of R are derived and their properties are studied. Furthermore, two parametric bootstrap confidence intervals are introduced in the paper. A comparative simulation study is conducted to assess the effectiveness of these four confidence interval methodologies in estimating R. The application of the methods is demonstrated using real data on fiber strength to showcase their practicability and relevance in the industry. [ABSTRACT FROM AUTHOR]

This paper proposes a novel approach to the fuzzy newsvendor problem for inventory management applications. The main contributions of the paper are the following: a new credibility estimation is proposed, to explore the neighborhood around the most impactful demand scenarios; a simulation procedure was designed for the different demand scenarios, which allows comparison of the proposed approach with classical and fuzzy multi-item newsvendor problems; a modified genetic algorithm (GA) is introduced to ameliorate previous genetic algorithms in both the generation and evaluation of solutions. The new formulation of the fuzzy newsvendor problem, together with the modified GA, were shown to improve the average profit by up to 55% in problems with low-budget scenarios. [ABSTRACT FROM AUTHOR]

This paper investigates the stability issues of time-varying delay systems. Firstly, a novel augmented Lyapunov functional is constructed for a class of bounded time-varying delays by introducing new double integral terms. Subsequently, a time-varying matrix-dependent zero equation is introduced to relax the constraints of traditional constant matrix-dependent zero equations. Secondly, for a class of periodic time-varying delays, considering the monotonicity of the delay and combining it with an augmented variable approach, Lyapunov functionals are constructed for monotonically increasing and monotonically decreasing delay intervals, respectively. Based on the constructed augmented Lyapunov functionals and the employed time-varying zero equation, less conservative stability criteria are obtained separately for bounded and periodic time-varying delays. Lastly, three examples are used to verify the superiority of the stability conditions obtained in this paper. [ABSTRACT FROM AUTHOR]

In order to enhance the trajectory tracking accuracy of distributed-driven intelligent vehicles, this paper formulates the tasks of torque output control for longitudinal dynamics and steering angle output control for lateral dynamics as Markov decision processes. To dissect the requirements of action output continuity for longitudinal and lateral control, this paper adopts the deep deterministic policy gradient algorithm (DDPG) for longitudinal velocity control and the deep Q-network algorithm (DQN) for lateral motion control. Multi-agent reinforcement learning methods are applied to the task of trajectory tracking in distributed-driven vehicle autonomous driving. By contrasting with two classical trajectory tracking control methods, the proposed approach in this paper is validated to exhibit superior trajectory tracking performance, ensuring that both longitudinal velocity deviation and lateral position deviation of the vehicle remain at lower levels. Compared with classical control methods, the maximum lateral position deviation is improved by up to 90.5% and the maximum longitudinal velocity deviation is improved by up to 97%. Furthermore, it demonstrates excellent generalization and high computational efficiency, and the running time can be reduced by up to 93.7%. [ABSTRACT FROM AUTHOR]

Converting a camera's RAW image to an RGB format for human perception involves utilizing an imaging pipeline, and a series of processing modules. Existing modules often result in varying degrees of original information loss, which can render the reverse imaging pipeline unable to recover the original RAW image information. To this end, this paper proposes a new, almost reversible image imaging pipeline. Thus, RGB images and RAW images can be effectively converted between each other. Considering the impact of original information loss, this paper introduces a two-stage tone mapping operation (TMO). In the first stage, the RAW image with a linear response is transformed into an RGB color image. In the second stage, color scale mapping corrects the dynamic range of the image suitable for human perception through linear stretching, and reduces the loss of sensitive information to the human eye during the integer process. effectively preserving the original image's dynamic information. The DCRAW imaging pipeline addresses the problem of high light overflow by directly highlighting cuts. The proposed imaging pipeline constructs an independent highlight processing module, and preserves the highlighted information of the image. The experimental results demonstrate that the two-stage tone mapping operation embedded in the imaging processing pipeline provided in this article ensures that the image output is suitable for human visual system (HVS) perception and retains more original image information. [ABSTRACT FROM AUTHOR]

Modern challenges such as the liberalization of the railway sector and growing demands for sustainability, high-quality services, and user satisfaction set new standards in railway operations. In this context, railway infrastructure managers (RIMs) play a crucial role in ensuring innovative approaches that will strengthen the position of railways in the market by enhancing efficiency and competitiveness. Evaluating their performance is essential for assessing the achieved objectives, and it is conducted through a wide range of key performance indicators (KPIs), which encompass various dimensions of operations. Monitoring and analyzing KPIs are crucial for improving service quality, achieving sustainability, and establishing a foundation for research and development of new strategies in the railway sector. This paper provides a detailed overview and evaluation of KPIs for RIMs. This paper creates a framework for RIM evaluation using various scientific methods, from identifying KPIs to applying complex analysis methods. A novel hybrid model, which integrates the fuzzy Delphi method for aggregating expert opinions on the KPIs' importance, the extended fuzzy analytic hierarchy process (AHP) method for determining the relative weights of these KPIs, and the ADAM method for ranking RIMs, has been developed in this paper. This approach enables a detailed analysis and comparison of RIMs and their performances, providing the basis for informed decision-making and the development of new strategies within the railway sector. The analysis results provide insight into the current state of railway infrastructure and encourage further efforts to improve the railway sector by identifying key areas for enhancement. The main contributions of the research include a detailed overview of KPIs for RIMs and the development of a hybrid multi-criteria decision making (MCDM) model. The hybrid model represents a significant step in RIM performance analysis, providing a basis for future research in this area. The model is universal and, as such, represents a valuable contribution to MCDM theory. [ABSTRACT FROM AUTHOR]

Self-supervised learning is a new machine learning method that does not rely on manually labeled data, and learns from rich unlabeled data itself by designing agent tasks using the input data as supervision to obtain a more generalized representation for application in downstream tasks. However, the current self-supervised learning suffers from the problem of relying on the selection and number of negative samples and the problem of sample bias phenomenon after graph data augmentation. In this paper, we investigate the above problems and propose a corresponding solution, proposing a graph contrastive learning algorithm without negative samples. The model uses matrix sketching in the implicit space for feature augmentation to reduce sample bias and iteratively trains the mutual correlation matrix of two viewpoints by drawing closer to the distance of the constant matrix as the objective function. This method does not require techniques such as negative samples, gradient stopping, and momentum updating to prevent self-supervised model collapse. This method is compared with 10 graph representation learning algorithms on four datasets for node classification tasks, and the experimental results show that the algorithm proposed in this paper achieves good results. [ABSTRACT FROM AUTHOR]

This paper undertakes a revisit of the sunk cost fallacy, which refers to the tendency of people to persist investing resources into something, even if it is destined to have no good outcome. We emphasize that the utilities associated with different alternatives are not static for decision makers, which is exactly opposite to the traditional perspective. This paper argues that the utility of an option may change due to the choice of another option, suggesting that decisions considered irrational by the traditional analytical method, i.e., sunk cost fallacy, may be rational. We propose a novel analytical method for decision making with sunk cost when considering the utility change and validate the effectiveness of this method through mathematical modeling and computational experiments. This paper mathematically describes such decision-making problems, analyzing the impact of changes in the utilities across different alternatives on decision making with a real-world example. Furthermore, we develop a two-stage stochastic optimization model for such decision-making problems and employ the sample average approximation (SAA) method to solve them. The results from computational experiments indicate that some decisions traditionally considered irrational are, in fact, rational when the utility of an option changes as a result of choosing another option. This paper, therefore, highlights the significance of incorporating utility changes into the decision-making process and stands as a valuable addition to the literature, offering a refreshed and effective decision-making method for improved decision making. [ABSTRACT FROM AUTHOR]

Most of the deep-learning algorithms on stock price volatility prediction in the existing literature use data such as same-frequency market indicators or technical indicators, and less consider mixed-frequency data, such as macro-data. Compared with the traditional model that only inputs the same-frequency data such as technical indicators and market indicators, this study proposes an improved deep-learning model based on mixed-frequency big data. This paper first introduces the reserve restricted mixed-frequency data sampling (RR-MIDAS) model to deal with the mixed-frequency data and, secondly, extracts the temporal and spatial features of volatility series by using the parallel model of CNN-LSTM and LSTM, and finally utilizes the Optuna framework for hyper-parameter optimization to achieve volatility prediction. For the deep-learning model with mixed-frequency data, its RMSE, MAE, MSLE, MAPE, SMAPE, and QLIKE are reduced by 18.25%, 14.91%, 30.00%, 12.85%, 13.74%, and 23.42%, respectively. This paper provides a more accurate and robust method for forecasting the realized volatility of stock prices under mixed-frequency data. [ABSTRACT FROM AUTHOR]

The paper introduces a powerful method for developing lightweight designs and enhancing the load-bearing capacity of common structures. The method, referred to as the 'method of aggregation', has been derived from reverse engineering of sub-additive and super-additive algebraic inequalities. The essence of the proposed method is consolidating multiple elements loaded in bending into a reduced number of elements with larger cross sections but a smaller total volume of material. This procedure yields a huge reduction in material usage and is the first major contribution of the paper. For instance, when aggregating eight load-carrying beams into two beams supporting the same total load, the material reduction was more than 1.58 times. The second major contribution of the paper is in demonstrating that consolidating multiple elements loaded in bending into a reduced number of elements with larger cross sections but the same total volume of material leads to a big increase in the load-bearing capacity of the structure. For instance, when aggregating eight cantilevered or simply supported beams into two beams with the same volume of material, the load-bearing capacity until a specified tensile stress increased twice. At the same time, the load-bearing capacity until a specified deflection increased four times. [ABSTRACT FROM AUTHOR]

In this paper, we address scheduling methods for queue stabilization and appropriate power allocation techniques in downlink dense user-centric scalable cell-free multiple-input multiple-output (CF-MIMO) networks. Scheduling is performed by the central processing unit (CPU) scheduler using Lyapunov optimization for queue stabilization. In this process, the drift-plus-penalty is utilized, and the control parameter V serves as the weighting factor for the penalty term. The control parameter V is fixed to achieve queue stabilization. We introduce the dynamic V method, which adaptively selects the control parameter V considering the current queue backlog, arrival rate, and effective rate. The dynamic V method allows flexible scheduling based on traffic conditions, demonstrating its advantages over fixed V scheduling methods. In cases where UEs scheduled with dynamic V exceed the number of antennas at the access point (AP), the semi-orthogonal user selection (SUS) algorithm is employed to reschedule UEs with favorable channel conditions and orthogonality. Dynamic V shows the best queue stabilization performance across all traffic conditions. It shows a 10% degraded throughput performance compared to V = 10,000. Max-min fairness (MMF), sum SE maximization, and fractional power allocation (FPA) are widely considered power allocation methods. However, the power allocation method proposed in this paper, combining FPA and queue-based FPA, achieves up to 60% better queue stabilization performance compared to MMF. It is suitable for systems requiring low latency. [ABSTRACT FROM AUTHOR]

Deep learning, a crucial technique for achieving artificial intelligence (AI), has been successfully applied in many fields. The gradual application of the latest architectures of deep learning in the field of time series forecasting (TSF), such as Transformers, has shown excellent performance and results compared to traditional statistical methods. These applications are widely present in academia and in our daily lives, covering many areas including forecasting electricity consumption in power systems, meteorological rainfall, traffic flow, quantitative trading, risk control in finance, sales operations and price predictions for commercial companies, and pandemic prediction in the medical field. Deep learning-based TSF tasks stand out as one of the most valuable AI scenarios for research, playing an important role in explaining complex real-world phenomena. However, deep learning models still face challenges: they need to deal with the challenge of large-scale data in the information age, achieve longer forecasting ranges, reduce excessively high computational complexity, etc. Therefore, novel methods and more effective solutions are essential. In this paper, we review the latest developments in deep learning for TSF. We begin by introducing the recent development trends in the field of TSF and then propose a new taxonomy from the perspective of deep neural network models, comprehensively covering articles published over the past five years. We also organize commonly used experimental evaluation metrics and datasets. Finally, we point out current issues with the existing solutions and suggest promising future directions in the field of deep learning combined with TSF. This paper is the most comprehensive review related to TSF in recent years and will provide a detailed index for researchers in this field and those who are just starting out. [ABSTRACT FROM AUTHOR]

The advancement toward sustainable infrastructure presents complex multi-objective optimization (MOO) challenges. This paper expands the current understanding of design frameworks that balance cost, environmental impacts, social factors, and structural integrity. Integrating MOO with multi-criteria decision-making (MCDM), the study targets enhancements in life cycle sustainability for complex engineering projects using precast modular road frames. Three advanced evolutionary algorithms—NSGA-II, NSGA-III, and RVEA—are optimized and deployed to address sustainability objectives under performance constraints. The efficacy of these algorithms is gauged through a comparative analysis, and a robust MCDM approach is applied to nine non-dominated solutions, employing SAW, FUCA, TOPSIS, PROMETHEE, and VIKOR decision-making techniques. An entropy theory-based method ensures systematic, unbiased criteria weighting, augmenting the framework's capacity to pinpoint designs balancing life cycle sustainability. The results reveal that NSGA-III is the algorithm converging towards the most cost-effective solutions, surpassing NSGA-II and RVEA by 21.11% and 10.07%, respectively, while maintaining balanced environmental and social impacts. The RVEA achieves up to 15.94% greater environmental efficiency than its counterparts. The analysis of non-dominated solutions identifies the A 4 design, utilizing 35 MPa concrete and B500S steel, as the most sustainable alternative across 80% of decision-making algorithms. The ranking correlation coefficients above 0.94 demonstrate consistency among decision-making techniques, underscoring the robustness of the integrated MOO and MCDM framework. The results in this paper expand the understanding of the applicability of novel techniques for enhancing engineering practices and advocate for a comprehensive strategy that employs advanced MOO algorithms and MCDM to enhance sustainable infrastructure development. [ABSTRACT FROM AUTHOR]

The level of difficulty of mathematical test items is a critical aspect for evaluating test quality and educational outcomes. Accurately predicting item difficulty during test creation is thus significantly important for producing effective test papers. This study used more than ten years of content and score data from China's Henan Provincial College Entrance Examination in Mathematics as an evaluation criterion for test difficulty, and all data were obtained from the Henan Provincial Department of Education. Based on the framework established by the National Center for Education Statistics (NCES) for test item assessment methodology, this paper proposes a new framework containing eight features considering the uniqueness of mathematics. Next, this paper proposes an XGBoost-based SHAP model for analyzing the difficulty of mathematics tests. By coupling the XGBoost method with the SHAP method, the model not only evaluates the difficulty of mathematics tests but also analyzes the contribution of specific features to item difficulty, thereby increasing transparency and mitigating the "black box" nature of machine learning models. The model has a high prediction accuracy of 0.99 for the training set and 0.806 for the test set. With the model, we found that parameter-level features and reasoning-level features are significant factors influencing the difficulty of subjective items in the exam. In addition, we divided senior secondary mathematics knowledge into nine units based on Chinese curriculum standards and found significant differences in the distribution of the eight features across these different knowledge units, which can help teachers place different emphasis on different units during the teaching process. In summary, our proposed approach significantly improves the accuracy of item difficulty prediction, which is crucial for intelligent educational applications such as knowledge tracking, automatic test item generation, and intelligent paper generation. These results provide tools that are better aligned with and responsive to students' learning needs, thus effectively informing educational practice. [ABSTRACT FROM AUTHOR]

To model fuzzy numbers with the confidence degree and better account for information uncertainty, Zadeh came up with the notion of Z-numbers, which can effectively combine the objective information of things with subjective human interpretation of perceptive information, thereby improving the human comprehension of natural language. Although many numbers are in fact Z-numbers, their higher computational complexity often prevents their recognition as such. In order to reduce computational complexity, this paper reviews the development and research direction of Z-numbers and deduces the operational rules for symmetric triangular Z-numbers. We first transform them into classical fuzzy numbers. Using linear programming, the extension principle of Zadeh, the convolution formula, and fuzzy number algorithms, we determine the operational rules for the basic operations of symmetric triangular Z-numbers, which are number-multiplication, addition, subtraction, multiplication, power, and division. Our operational rules reduce the complexity of calculation, improve computational efficiency, and effectively reduce the information difference while being applicable to other complex operations. This paper innovatively combines Z-numbers with classical fuzzy numbers in Z-number operations, and as such represents a continuation and innovation of the research on the operational laws of Z-numbers. [ABSTRACT FROM AUTHOR]

Pattern recognition systems always misclassify anomalies, which can be dangerous for uninformed users. Therefore, anomalies must be filtered out from each classification. The main challenge for the anomaly filter design is the huge number of possible anomaly samples compared with the number of samples in the training set. Tailoring the filter for the given classifier is just the first step in this reduction. Paper tests the hypothesis that the filter trained in avoiding "near" anomalies will also refuse the "far" anomalies, and the anomaly detector is then just a classifier distinguishing between "far real" and "near anomaly" samples. As a "far real" samples generator was used, a Generative Adversarial Network (GAN) fake generator that transforms normally distributed random seeds into fakes similar to the training samples. The paper proves the assumption that seeds unused in fake training will generate anomalies. These seeds are distinguished according to their Chebyshev norms. While the fakes have seeds within the hypersphere with a given radius, the near anomalies have seeds within the sphere near cover. Experiments with various anomaly test sets have shown that GAN-based anomaly detectors create a reliable anti-anomaly shield using the abovementioned assumptions. The proposed anomaly detector is tailored to the given classifier, but its limitation is due to the need for the availability of the database on which the classifier was trained. [ABSTRACT FROM AUTHOR]

Accurately predicting the price of carbon is an effective way of ensuring the stability of the carbon trading market and reducing carbon emissions. Aiming at the non-smooth and non-linear characteristics of carbon price, this paper proposes a novel hybrid prediction model based on improved feature extraction and non-linear integration, which is built on complete ensemble empirical mode decomposition with adaptive noise (CEEMDAN), fuzzy entropy (FuzzyEn), improved random forest using particle swarm optimisation (PSORF), extreme learning machine (ELM), long short-term memory (LSTM), non-linear integration based on multiple linear regression (MLR) and random forest (MLRRF), and error correction with the autoregressive integrated moving average model (ARIMA), named CEEMDAN-FuzzyEn-PSORF-ELM-LSTM-MLRRF-ARIMA. Firstly, CEEMDAN is combined with FuzzyEn in the feature selection process to improve extraction efficiency and reliability. Secondly, at the critical prediction stage, PSORF, ELM, and LSTM are selected to predict high, medium, and low complexity sequences, respectively. Thirdly, the reconstructed sequences are assembled by applying MLRRF, which can effectively improve the prediction accuracy and generalisation ability. Finally, error correction is conducted using ARIMA to obtain the final forecasting results, and the Diebold–Mariano test (DM test) is introduced for a comprehensive evaluation of the models. With respect to carbon prices in the pilot regions of Shenzhen and Hubei, the results indicate that the proposed model has higher prediction accuracy and robustness. The main contributions of this paper are the improved feature extraction and the innovative combination of multiple linear regression and random forests into a non-linear integrated framework for carbon price forecasting. However, further optimisation is still a work in progress. [ABSTRACT FROM AUTHOR]

In this paper, we explore the trade-offs between public and private investment in autonomous driving technologies. Utilizing an evolutionary game model, we delve into the complex interaction mechanisms between governments and auto manufacturers, focusing on how strategic decisions impact overall outcomes. Specifically, we predict that governments may opt for strategies such as constructing and maintaining infrastructure for Roadside Infrastructure-based Vehicles (RIVs) or subsidizing high-level Autonomous Driving Vehicles (ADVs) without additional road infrastructure. Manufacturers' choices involve deciding whether to invest in RIVs or ADVs, depending on governmental policies and market conditions. Our simulation results, based on scenarios derived from existing economic data and forecasts on technology development costs, suggest that government subsidy policies need to dynamically adjust in response to manufacturers' shifting strategies and market behavior. This dynamic adjustment is crucial as it addresses the evolving economic environment and technological advancements, ensuring that subsidies effectively incentivize the desired outcomes in autonomous vehicle development. The findings of this paper could serve as valuable decision-making tools for governments and auto manufacturers, guiding investment strategies that align with the dynamic landscape of autonomous driving technology. [ABSTRACT FROM AUTHOR]

As the core component of the wind turbine generation gearbox, the gear-rotor-bearing transmission system typically operates in harsh environments, inevitably leading to the occurrence of composite faults in the system, which exacerbates system vibration. Therefore, it is necessary to study the vibration characteristics of wind turbine helical gear-rotor-bearing transmission systems with composite faults. This paper uses an improved energy method to calculate the theoretical time-varying mesh stiffness of a helical gear with a root crack failure. On the premise of considering the time-varying meshing stiffness of the faulty helical gear, the gear eccentric fault, and the nonlinear support force of the faulty bearing, a multi-degree-of-freedom helical gear-rotor-bearing transmission system with compound faults was established by using the lumped parameter method. The dynamic model of the system was solved based on the Runge–Kutta method, and the vibration response of the system under healthy conditions, single faults with gear eccentricity, single faults with tooth root cracks, and coupled bearing composite faults were simulated and analyzed. The results show that the simulation results based on KISSsoft software 2018 version verify the effectiveness of the improved energy method; the existence of single faults and composite faults will cause the fault characteristics in the time domain and frequency domain responses. In this paper, the influence of a single fault and a complex fault on the time domain and frequency domain of the system is mainly discovered through the fault study of the helical rotor-bearing system, and the influence of the fault degree on the vibration of the gear motion system is discussed. The greater the degree of the fault, the more vibration of the system occurs; accordingly, when the system is under the coupling of tooth root crack and bearing fault, there is a significant difference compared with the healthy system and the single fault system. The system vibration has obvious time domain and frequency domain signal characteristics, including periodic pulse impacts caused by gear faults and time domain impact caused by bearing. The fault characteristic frequencies can also be found in the frequency domain. In this paper, the fault study of a helical gear of wind turbine generation provides a reference for the theoretical analysis of the vibration characteristics of the helical gear-rotor-bearing system under various fault conditions, lays a solid foundation for the simulation and subsequent diagnosis of the composite fault signal of the system, and provides help for the fault diagnosis of wind turbine gearboxes in the future. [ABSTRACT FROM AUTHOR]

Electro-hydraulic actuators have witnessed significant development over recent years due to their remarkable abilities to perform complex and dynamic movements. Integrating such an actuator in humanoids is highly beneficial, leading to a humanoid capable of performing complex tasks requiring high force. This highlights the importance of safety, especially since high power output and safe interaction seem to be contradictory; the greater the robot's ability to generate high dynamic movements, the more difficult it is to achieve safety, as this requires managing a large amount of motor energy before, during, and after the collision. No matter what technology or algorithm is used to achieve safety, none can be implemented without a stable control system. Hence, one of the main parameters remains the quality and reliability of the robot's control architecture through handling a huge amount of data without system failure. This paper addresses the development of a stable control architecture that ensures, in later stages, that the safety algorithm is implemented correctly. The optimum control architecture to utilize and ensure the maximum benefit of electro-hydraulic actuators in humanoid robots is one of the important subjects in this field. For a stable and safe functioning of the humanoid, the development of the control architecture and the communication between the different components should adhere to some requirements such as stability, robustness, speed, and reduced complexity, ensuring the easy addition of numerous components. This paper presents the developed control architecture for an underdeveloped electro-hydraulic actuated humanoid. The proposed solution has the advantage of being a distributed, real-time, open-source, modular, and adaptable control architecture, enabling simple integration of numerous sensors and actuators to emulate human actions and safely interact with them. The contribution of this paper is an enhancement of the updated rate compared to other humanoids by 20% and by 40 % in the latency of the master. The results demonstrate the potential of using EtherCAT fieldbus and open-source software to develop a stable robot control architecture capable of integrating safety and security algorithms in later stages. [ABSTRACT FROM AUTHOR]

With the development of artificial intelligence (AI), deep learning is widely used in various industries. At CRYPTO 2019, researchers used deep learning to analyze the block cipher for the first time and constructed a differential neural network distinguisher to meet a certain accuracy. In this paper, a mixture differential neural network distinguisher using ResNet is proposed to further improve the accuracy by exploring the mixture differential properties. Experiments are conducted on SIMON32/64, and the accuracy of the 8-round mixture differential neural network distinguisher is improved from 74.7% to 92.3%, compared with that of the previous differential neural network distinguisher. The prediction accuracy of the differential neural network distinguisher is susceptible to the choice of the specified input differentials, whereas the mixture differential neural network distinguisher is less affected by the input difference and has greater robustness. Furthermore, by combining the probabilistic expansion of rounds and the neutral bit, the obtained mixture differential neural network distinguisher is extended to 11 rounds, which can realize the 12-round actual key recovery attack on SIMON32/64. With an appropriate increase in the time complexity and data complexity, the key recovery accuracy of the mixture differential neural network distinguisher can be improved to 55% as compared to 52% of the differential neural network distinguisher. The mixture differential neural network distinguisher proposed in this paper can also be applied to other lightweight block ciphers. [ABSTRACT FROM AUTHOR]

This paper explores the application of Random Matrix Theory (RMT) as a methodological enhancement for portfolio selection within financial markets. Traditional approaches to portfolio optimization often rely on historical estimates of correlation matrices, which are particularly susceptible to instabilities. To address this challenge, we combine a data preprocessing technique based on the Hilbert transformation of returns with RMT to refine the accuracy and robustness of correlation matrix estimation. By comparing empirical correlations with those generated through RMT, we reveal non-random properties and uncover underlying relationships within financial data. We then utilize this methodology to construct the correlation network dependence structure used in portfolio optimization. The empirical analysis presented in this paper validates the effectiveness of RMT in enhancing portfolio diversification and risk management strategies. This research contributes by offering investors and portfolio managers with methodological insights to construct portfolios that are more stable, robust, and diversified. At the same time, it advances our comprehension of the intricate statistical principles underlying multivariate financial data. [ABSTRACT FROM AUTHOR]

This paper investigates the adaptive neural network (NN) tracking control problem for stochastic nonlinear systems with multiple actuator constraints and full-state constraints. The issue of system full-state constraints is tackled by a generalized barrier Lyapunov function (GBLF), and the output constraints of the system are considered to be in the form of time-varying functions, which are more in line with the needs of real physical systems. The NN approximation technique is utilized to overcome the influence of the uncertainty term on controller design due to randomness. Based on the backstepping technique, a neural adaptive fixed-time tracking control strategy is designed. Under the designed control strategy, the tracking accuracy of the controlled system can reach the expectation in a fixed time. The multi-actuator constraints are converted into a generalized mathematical model to simplify the controller design process. Using the characteristics of the hyperbolic tangent function, a new function called practical virtual control signal is designed using the virtual control signal as the input. Due to the saturation constraint property of the hyperbolic tangent function, it is theoretically ensured that no state of the system exceeds the constraints through to the new form of the virtual controller. Using the adaptive controller constructed in this paper, the controlled system is semi-global fixed-time stabilized in probability (SGFSP). Finally, the effectiveness of the proposed control strategy is further verified by simulation examples. [ABSTRACT FROM AUTHOR]