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]

The current media digitization and artistic strength are more powerful than the previous application. Using its advanced information display methods and technologies, this paper proposed a digital museum built by integrating digital media art with AR technology, which was helpful to analyze and solve the objective problems of current museums' ecological imbalance and single-system function. Based on the principles and laws of augmented reality technology, the museum guide system is optimized. In the system evaluation experiment, firstly, the cultural relics of six kinds of materials are used as the target image to extract and identify the features of the image. In experiments, the recognition performance of three feature algorithms, Binary Robust Invariant Scalable Keypoints (BRISK), organizational retaliatory behavior (ORB), and Accelerated-KAZE (AKAZE), is compared. Among them, the ORB algorithm is superior to other algorithms in feature richness and recognition speed but is inferior to the other two algorithms in recognition accuracy. Therefore, this paper optimized the ORB algorithm based on the characteristics of the ORB algorithm. The ORB algorithm must calculate the orientation of the feature points before constructing the feature descriptor. After optimizing the parameters, the improved ORB algorithm not only has advantages in feature richness and recognition time but also improves the recognition accuracy up to 98.3%, which is 16% higher than the traditional ORB algorithm. Therefore, the application prospects of AR technology in digital media design are very important. [ABSTRACT FROM AUTHOR]

With the proliferation of blockchain technology in decentralized applications like decentralized finance and supply chain and identity management, smart contracts operating on a blockchain frequently encounter security issues such as reentrancy vulnerabilities, timestamp dependency vulnerabilities, tx.origin vulnerabilities, and integer overflow vulnerabilities. These security concerns pose a significant risk of causing substantial losses to user accounts. Consequently, the detection of vulnerabilities in smart contracts has become a prominent area of research. Existing research exhibits limitations, including low detection accuracy in traditional smart contract vulnerability detection approaches and the tendency of deep learning-based solutions to focus on a single type of vulnerability. To address these constraints, this paper introduces a smart contract vulnerability detection method founded on multimodal feature fusion. This method adopts a multimodal perspective to extract three modal features from the lifecycle of smart contracts, leveraging both static and dynamic features comprehensively. Through deep learning models like Graph Convolutional Networks (GCNs) and bidirectional Long Short-Term Memory networks (bi-LSTMs), effective detection of vulnerabilities in smart contracts is achieved. Experimental results demonstrate that the proposed method attains detection accuracies of 85.73% for reentrancy vulnerabilities, 85.41% for timestamp dependency vulnerabilities, 83.58% for tx.origin vulnerabilities, and 90.96% for integer Overflow vulnerabilities. Furthermore, ablation experiments confirm the efficacy of the newly introduced modal features, highlighting the significance of fusing dynamic and static features in enhancing detection accuracy. [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]

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]

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]

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]

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 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 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 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]

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]

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]

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]

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]

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]

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]

When constructing an investment portfolio, it is important to maximize returns while minimizing risks. This portfolio optimization can be considered as a multi-objective optimization problem that is solved by means of multi-objective evolutionary algorithms. The use of multi-objective evolutionary algorithms (MOEAs) provides an effective approach for dealing with the complex data involved in multi-objective optimization problems. However, current MOEAs often rely on a single strategy to obtain optimal solutions, leading to premature convergence and an insufficient population diversity. In this paper, a new MOEA called the Synergistic MOEA with Diffusion Population Generation (DPG-SMOEA) is proposed to address these limitations by integrating MOEAs with diffusion models. To train the diffusion model, a mixed memory pool strategy is optimized, which collects improved solutions from the MOEA/D-AEE, an optimized MOEA, as training samples. The trained model is then used to generate offspring. Considering the cold-start mechanism of the diffusion model, particularly during the training phase where it is not suitable for generating initial offspring, this paper adjusts and optimizes the collaborative strategy to enhance the synergy between the diffusion model and MOEA/D-AEE. Experimental validation of the DPG-SMOEA demonstrates the advantages of using diffusion models in low-dimensional and relatively continuous data analysis. The results show that the DPG-SMOEA performs well on the low-dimensional Hang Seng Index test dataset, while achieving average performance on other high-dimensional datasets, consistent with theoretical predictions. Overall, the DPG-SMOEA achieves better results compared to MOEA/D-AEE and other multi-objective optimization algorithms. [ABSTRACT FROM AUTHOR]

This paper conducts an in-depth study on the self-similar transformation, Darboux transformation, and the excitation and propagation characteristics of high-order bright–dark rogue wave solutions in the (2+1)-dimensional variable-coefficient Zakharov equation. The Zakharov equation is instrumental for studying complex nonlinear interactions in these areas, with specific implications for energy transfer processes in plasma and nonlinear wave propagation systems. By analyzing bright–dark rogue wave solutions—phenomena that are critical in understanding high-energy events in optical and fluid environments—this research elucidates the intricate dynamics of energy concentration and dissipation. Using the self-similar transformation method, we map the (2+1)-dimensional equation to a more tractable (1+1)-dimensional nonlinear Schrödinger equation form. Through the Lax pair and Darboux transformation, we successfully construct high-order solutions that reveal how variable coefficients influence rogue wave features, such as shape, amplitude, and dynamics. Numerical simulations demonstrate the evolution of these rogue waves, offering novel perspectives for predicting and mitigating extreme wave events in engineering applications.This paper crucially advances the practical understanding and manipulation of nonlinear wave phenomena in variable environments, providing significant insights for applications in optical fibers, atmospheric physics, and marine engineering. [ABSTRACT FROM AUTHOR]

The Solow residual method, traditionally pivotal for calculating total factor productivity (TFP), is typically not applied to green TFP calculations due to its exclusion of undesired outputs. Diverging from traditional approaches and other frontier methodologies such as Data Envelopment Analysis (DEA) and Stochastic Frontier Analysis (SFA), this paper integrates undesired outputs and three types of spatial spillover effects into the conventional Solow framework, thereby creating a new spatiotemporal econometric Solow residual method (STE-SRM). Utilizing this novel method, the study computes the industrial green TFPs for 280 Chinese cities from 2003 to 2019, recalculates these TFPs using DEA-SBM and Bayesian SFA for the same cities and periods, and assesses the accuracy of the STE-SRM-derived TFPs through comparative analysis. Additionally, the paper explores the statistical properties of China's urban industrial green TFPs as derived from the STE-SRM, employing Dagum's Gini coefficient and spatial convergence analyses. The findings first indicate that by incorporating undesired outputs and spatial spillover into the Solow residual method, green TFPs are computable in alignment with the traditional Solow logic, although the allocation of per capita inputs and undesired outputs hinges on selecting the optimal empirical production function. Second, China's urban industrial green TFPs, calculated using the STE-SRM with the spatial Durbin model with mixed effects as the optimal model, show that cities like Huangshan, Fangchenggang, and Sanya have notably higher TFPs, whereas Jincheng, Datong, and Taiyuan display lower TFPs. Third, comparisons of China's urban industrial green TFP calculations reveal that those derived from the STE-SRM demonstrate broader but more concentrated results, while Bayesian SFA results are narrower and less concentrated, and DEA-SBM findings sit between these extremes. Fourth, the study highlights significant spatial heterogeneity in China's urban industrial green TFPs across different regions—eastern, central, western, and northeast China—with evident sigma convergence across the urban landscape, though absolute beta convergence is significant only in a limited subset of cities and time periods. [ABSTRACT FROM AUTHOR]

With the increasing demand for road traffic safety assessment, global concerns about road safety have been rising. This is particularly evident with the widespread adoption of V2X (Vehicle-to-Everything) technology, where people are more intensively focused on how to leverage advanced technological means to effectively address challenges in traffic safety. Through the research of driving style recognition technology, accurate assessment of driving behavior and the provision of personalized safety prompts and warnings have become crucial for preventing traffic accidents. This paper proposes a risk field construction technique based on environmental data collected by in-vehicle sensors. This paper introduces a driving style recognition algorithm utilizing risk field visualization and mask learning technologies. The research results indicate that, compared to traditional classical models, the improved algorithm performs excellently in terms of accuracy, stability, and robustness, enhancing the accuracy of driving style recognition and enabling a more effective evaluation of road safety. [ABSTRACT FROM AUTHOR]

This document discusses the challenges faced in mathematical modeling and controlling COVID-19 epidemics. It highlights the global impact of the pandemic on the economy and health, as well as the uneven effects on different age groups. The availability of vaccines led to mass vaccination campaigns, prompting researchers to implement new strategies and innovative approaches. The document also mentions various journals that have published special issues on COVID-19, covering topics such as forecasting, vaccination strategies, and control measures. The special issue presented in this document consists of eleven papers that analyze clinical characteristics, variant spread, economic recovery, mortality rates, non-pharmaceutical interventions, and coordinated actions. The papers propose mathematical models and control strategies to minimize disease spread and prioritize vaccination. The document emphasizes the multidisciplinary nature of the research, involving fields such as applied mathematics, data science, engineering, biology, and economics. Overall, this special issue provides valuable insights into the mathematical modeling and control of COVID-19 epidemics. [Extracted from the article]

Doubly coupled designs (DCDs) have better space-filling properties between the qualitative and quantitative factors than marginally coupled designs (MCDs) which are suitable for computer experiments with both qualitative and quantitative factors. In this paper, we propose a new class of DCDs, called group doubly coupled designs (GDCDs), and provide methods for constructing two forms of GDCDs, within-group doubly coupled designs and between-group doubly coupled designs. The proposed GDCDs can accommodate more qualitative factors than DCDs, when the subdesigns for the qualitative factors are symmetric. The subdesigns of qualitative factors are not asymmetric in the existing results on DCDs, and in this paper, we construct GDCDs with symmetric and asymmetric designs for the qualitative factors, respectively. Moreover, detailed comparisons with existing MCDs show that GDCDs have better space-filling properties between qualitative and quantitative factors. Finally, the methods are particularly easy to implement. [ABSTRACT FROM AUTHOR]

Fault dynamometer cards are the basis of the diagnosis technique for sucker rod pumping systems. Predicting fault cards with a pumping condition model is an economical and effective method. The usual model is described by a mixed function of the pump displacement and pump load, and it is difficult to use in the prediction method based on the analytical solution of the sucker rod string wave equation. In this paper, a normal pumping condition model described by a function of polished rod velocity is proposed. For the analytical solution of the sucker rod wave equation, an iterative prediction algorithm with pumping condition models is proposed, its convergence is analyzed, and then it is validated by classical finite difference method simulated cards and measured surface dynamometer cards. The results show that the proposed algorithm is accurate. The algorithm has a maximum relative error of 0.10% for the classical method simulated card area and 1.45% for the measured card area. The research of this paper provides an effective scheme for the design, prediction, and fault diagnosis of a sucker rod pumping system with an analytical solution. [ABSTRACT FROM AUTHOR]

In this study, the portfolio optimization problem is explored, using a combination of classical and quantum computing techniques. The portfolio optimization problem with specific objectives or constraints is often a quadratic optimization problem, due to the quadratic nature of, for example, risk measures. Quantum computing is a promising solution for quadratic optimization problems, as it can leverage quantum annealing and quantum approximate optimization algorithms, which are expected to tackle these problems more efficiently. Quantum computing takes advantage of quantum phenomena like superposition and entanglement. In this paper, a specific problem is introduced, where a portfolio of loans need to be optimized for 2030, considering 'Return on Capital' and 'Concentration Risk' objectives, as well as a carbon footprint constraint. This paper introduces the formulation of the problem and how it can be optimized using quantum computing, using a reformulation of the problem as a quadratic unconstrained binary optimization (QUBO) problem. Two QUBO formulations are presented, each addressing different aspects of the problem. The QUBO formulation succeeded in finding solutions that met the emission constraint, although classical simulated annealing still outperformed quantum annealing in solving this QUBO, in terms of solutions close to the Pareto frontier. Overall, this paper provides insights into how quantum computing can address complex optimization problems in the financial sector. It also highlights the potential of quantum computing for providing more efficient and robust solutions for portfolio management. [ABSTRACT FROM AUTHOR]

Digital financial inclusion and common prosperity are pivotal elements in promoting the sustainable socioeconomic development of China. This study introduces a novel Multi-Criteria Decision Analysis (MCDA) method to evaluate the Common Prosperity Index (CPI). Using this index, alongside the Digital Financial Inclusion Index (DFII) released by Peking University, it examines the evolution of the coupling coordination relationship between digital financial inclusion and common prosperity within the Yangtze River Delta (YRD) urban agglomeration from 2011 to 2021. By integrating gravity models and social network analysis, in this paper, we thoroughly investigate the spatiotemporal evolution characteristics of the spatial network of this coupling coordination relationship. The results indicate that both the DFII and CPI generally exhibit an upward trend, but the decline in the coupling degree reflects a weakened interaction strength between them. Specifically, Anhui significantly lags behind Jiangsu, Zhejiang, and Shanghai in the development of digital financial inclusion and common prosperity, indicating regional development imbalances. Furthermore, the strength of spatial connections in city coupling coordination has significantly increased, with Nanjing's siphon effect on cities in Anhui becoming markedly stronger, and the number of core cities in the network increasing, which demonstrates a geographical proximity feature in network development. Additionally, the overall network characteristics are transitioning towards higher density and "small-world" properties, suggesting a trend toward network stabilization. The disparity in centrality among cities has decreased, with an overall enhancement in centrality, where the spatial spillover effects from core areas such as Hangzhou-Ningbo, Nanjing-Changzhou, and Shanghai-Suzhou-Wuxi significantly promote the development of peripheral cities. Based on these findings, this paper proposes policy recommendations for the sustainable development of digital financial inclusion and common prosperity in the YRD region. [ABSTRACT FROM AUTHOR]