Search

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 study investigates the integration of quantum circuits with classical neural networks for enhancing credit scoring for small- and medium-sized enterprises (SMEs). We introduce a hybrid quantum–classical model, focusing on the synergy between quantum and classical rather than comparing the performance of separate quantum and classical models. Our model incorporates a quantum layer into a traditional neural network, achieving notable reductions in training time. We apply this innovative framework to a binary classification task with a proprietary real-world classical credit default dataset for SMEs in Singapore. The results indicate that our hybrid model achieves efficient training, requiring significantly fewer epochs (350) compared to its classical counterpart (3500) for a similar predictive accuracy. However, we observed a decrease in performance when expanding the model beyond 12 qubits or when adding additional quantum classifier blocks. This paper also considers practical challenges faced when deploying such models on quantum simulators and actual quantum computers. Overall, our quantum–classical hybrid model for credit scoring reveals its potential in industry, despite encountering certain scalability limitations and practical challenges. [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]

Object detection plays a crucial role in autonomous driving assistance systems. It requires high accuracy for prediction, a small size for deployment on mobile devices, and real-time inference speed to ensure safety. In this paper, we present a compact and efficient algorithm called YOLOX with United Attention Head (UAH-YOLOX) for detection in autonomous driving scenarios. By replacing the backbone network with GhostNet for feature extraction, the model reduces the number of parameters and computational complexity. By adding a united attention head before the YOLO head, the model effectively detects the scale, position, and contour features of targets. In particular, an attention module called Spatial Self-Attention is designed to extract spatial location information, demonstrating great potential in detection. In our network, the IOU Loss (Intersection of Union) has been replaced with CIOU Loss (Complete Intersection of Union). Further experiments demonstrate the effectiveness of our proposed methods on the BDD100k dataset and the Caltech Pedestrian dataset. UAH-YOLOX achieves state-of-the-art results by improving the detection accuracy of the BDD100k dataset by 1.70% and increasing processing speed by 3.37 frames per second (FPS). Visualization provides specific examples in various scenarios. [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]

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

Zero-shot event detection aims to involve the automatic discovery and classification of new events within unstructured text. Current zero-shot event detection methods have not considered addressing the problem more effectively from the perspective of improving event representations. In this paper, we propose dual-contrastive prompting (COPE) model for learning event representations to address zero-shot event detection, which leverages prompts to assist in generating event embeddings using a pretrained language model, and employs a contrastive fusion approach to capture complex interaction information between trigger representations and sentence embeddings to obtain enhanced event representations. Firstly, we introduce a sample generator to create ordered contrastive sample sequences with varying degrees of similarity for each event instance, aiding the model in better distinguishing different types of events. Secondly, we design two distinct prompts to obtain trigger representations and event sentence embeddings separately. Thirdly, we employ a contrastive fusion module, where trigger representations and event sentence embeddings interactively fuse in vector space to generate the final event representations. Experiments show that our model is more effective than the most advanced methods. [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]

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]

Quantum computing advancements pose security challenges for cryptography. Specifically, Grover's search algorithm affects the reduction in the search complexity of symmetric-key encryption and hash functions. Recent efforts have been made to estimate the complexity of Grover's search and evaluate post-quantum security. In this paper, we propose a depth-optimized quantum circuit implementation for ASCON, including both symmetric-key encryption and hashing algorithms, as a part of the lightweight cryptography standardization by NIST (National Institute of Standards and Technology). As far as we know, this is the first implementation of a quantum circuit for the ASCON AEAD (Authenticated Encryption with Associated Data) scheme, which is a symmetric-key algorithm. Also, our quantum circuit implementation of the ASCON-HASH achieves a reduction of more than 88.9% in the Toffoli depth and more than 80.5% in the full depth compared to the previous work. As per our understanding, the most effective strategy against Grover's search involves minimizing the depth of the quantum circuit for the target cipher. We showcase the optimal Grover's search cost for ASCON and introduce a proposed quantum circuit optimized for depth. Furthermore, we utilize the estimated cost to evaluate post-quantum security strength of ASCON, employing the relevant evaluation criteria and the latest advancements in research. [ABSTRACT FROM AUTHOR]

List intersection plays a pivotal role in various domains such as search engines, database systems, and social networks. Efficient indexes and query strategies can significantly enhance the efficiency of list intersection. Existing inverted index-based algorithms fail to utilize the length information of documents and require excessive list intersections, resulting in lower efficiency. To address this issue, in this paper, we propose the LDRpV (Length-based Document Reordering plus Verification) algorithm. LDRpV filters out documents that are unlikely to satisfy the intersection results by reordering documents based on their length, thereby reducing the number of candidates. Additionally, to minimize the number of list intersection operations, an intersection and verification strategy is designed, where only the first m lists are intersected, and the resulting candidate set is directly verified. This approach effectively improves the efficiency of list intersection. Experimental results on four real datasets demonstrate that LDRpV can achieve a maximum efficiency improvement of 46.69% compared to the most competitive counterparts. [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]

To address the cost and efficiency issues of manually analysing requirement dependency in requirements engineering, a requirement dependency extraction method based on part-of-speech features and an improved stacking ensemble learning model (P-Stacking) is proposed. Firstly, to overcome the problem of singularity in the feature extraction process, this paper integrates part-of-speech features, TF-IDF features, and Word2Vec features during the feature selection stage. The particle swarm optimization algorithm is used to allocate weights to part-of-speech tags, which enhances the significance of crucial information in requirement texts. Secondly, to overcome the performance limitations of standalone machine learning models, an improved stacking model is proposed. The Low Correlation Algorithm and Grid Search Algorithms are utilized in P-stacking to automatically select the optimal combination of the base models, which reduces manual intervention and improves prediction performance. The experimental results show that compared with the method based on TF-IDF features, the highest F1 scores of a standalone machine learning model in the three datasets were improved by 3.89%, 10.68%, and 21.4%, respectively, after integrating part-of-speech features and Word2Vec features. Compared with the method based on a standalone machine learning model, the improved stacking ensemble machine learning model improved F1 scores by 2.29%, 5.18%, and 7.47% in the testing and evaluation of three datasets, respectively. [ABSTRACT FROM AUTHOR]

Over the last few decades, Multi-criteria Decision Analysis (MCDA) techniques have been successfully applied to complex decision-making problems in a wide range of fields, such as economics, finance, logistics, environmental restoration, health or industrial organization, to name but a few, and imprecision and uncertainty have been incorporated into the decision-making process and applied to group decision-making contexts. The paper by Segura et at. [[7]] proposes models to solve real-world supplier evaluation problems and validate them with real data on fresh fruits in a supermarket chain. It is hoped that the international scientific community will find these selected research papers impactful and that these papers will motivate further research on MCDA for solving complex problems in various disciplines and application fields. [Extracted from the article]

The high-quality development of the industrial software industry is of strategic significance to enhancing the core competitiveness of the manufacturing industry and promoting the high-quality development of China's industrial economy. By integrating the "capital-technology-environment-human" production factor theory and configuration perspective, this paper constructs a comprehensive analysis framework that drives the total factor productivity (TFP) of the industrial software industry. This paper uses 40 typical industrial software firms in 2018–2020 as case samples and uses fuzzy set Qualitative Comparative Analysis (fsQCA) to empirically explore the influencing factors and complex mechanisms that achieve high-quality development of the industrial software industry. It is found that: (1) a single industrial factor is hardly a necessary condition to drive the industrial software industry; (2) there are four paths to achieving high TFP, which are summarized as "technical-human-environmental" balanced driving type, "capital-human-environmental" balanced driving type, "technical-capital" dual driving type, and "capital" single driving type. There are four driving mechanisms. There are also four not-high TFP configurations with asymmetric characteristics; (3) under certain conditions, the combination of capital factors, technical factors, environmental factors, and human factors can drive TFP in an "all roads lead to Rome". In this process, the government's attention plays a more universal role. The study not only expands the application scenarios of fsQCA but also provides decision guidelines for the practice of strategic emerging industrialization represented by the industrial software industry. [ABSTRACT FROM AUTHOR]

This paper reviews 17 studies addressing dynamic option hedging in frictional markets through Deep Reinforcement Learning (DRL). Specifically, this work analyzes the DRL models, state and action spaces, reward formulations, data generation processes and results for each study. It is found that policy methods such as DDPG are more commonly employed due to their suitability for continuous action spaces. Despite diverse state space definitions, a lack of consensus exists on variable inclusion, prompting a call for thorough sensitivity analyses. Mean-variance metrics prevail in reward formulations, with episodic return, VaR and CvaR also yielding comparable results. Geometric Brownian motion is the primary data generation process, supplemented by stochastic volatility models like SABR (stochastic alpha, beta, rho) and the Heston model. RL agents, particularly those monitoring transaction costs, consistently outperform the Black–Scholes Delta method in frictional environments. Although consistent results emerge under constant and stochastic volatility scenarios, variations arise when employing real data. The lack of a standardized testing dataset or universal benchmark in the RL hedging space makes it difficult to compare results across different studies. A recommended future direction for this work is an implementation of DRL for hedging American options and an investigation of how DRL performs compared to other numerical American option hedging methods. [ABSTRACT FROM AUTHOR]

Functional movement screening (FMS) is a crucial testing method that evaluates fundamental movement patterns in the human body and identifies functional limitations. However, due to the inherent complexity of human movements, the automated assessment of FMS poses significant challenges. Prior methodologies have struggled to effectively capture and model critical human features in video data. To address this challenge, this paper introduces an automatic assessment approach for FMS by leveraging deep learning techniques. The proposed method harnesses an I3D network to extract spatiotemporal video features across various scales and levels. Additionally, an attention mechanism (AM) module is incorporated to enable the network to focus more on human movement characteristics, enhancing its sensitivity to diverse location features. Furthermore, the multilayer perceptron (MLP) module is employed to effectively discern intricate patterns and features within the input data, facilitating its classification into multiple categories. Experimental evaluations conducted on publicly available datasets demonstrate that the proposed approach achieves state-of-the-art performance levels. Notably, in comparison to existing state-of-the-art (SOTA) methods, this approach exhibits a marked improvement in accuracy. These results corroborate the efficacy of the I3D-AM-MLP framework, indicating its significance in extracting advanced human movement feature expressions and automating the assessment of functional movement screening. [ABSTRACT FROM AUTHOR]

In this paper, a multi-point geostatistical (MPS) method based on variational function partition simulation is proposed to solve the key problem of MPS 3D modeling using 2D training images. The new method uses the FILTERSIM algorithm framework, and the variational function is used to construct simulation partitions and training image sequences, and only a small number of training images close to the unknown nodes are used in the partition simulation to participate in the MPS simulation. To enhance the reliability, a new covariance filter is also designed to capture the diverse features of the training patterns and allow the filter to downsize the training patterns from any direction; in addition, an information entropy method is used to reconstruct the whole 3D space by selecting the global optimal solution from several locally similar training patterns. The stability and applicability of the new method in complex geological modeling are demonstrated by analyzing the parameter sensitivity and algorithm performance. A geological model of a uranium deposit is simulated to test the pumping of five reserved drill holes, and the results show that the accuracy of the simulation results of the new method is improved by 11.36% compared with the traditional MPS method. [ABSTRACT FROM AUTHOR]

The contactless transmission between the conductor rotor and the permanent magnet (PM) rotor of an adjustable permanent magnet coupler (APMC) provides the device with significant tolerance for alignment errors, making the performance estimation complicated and inaccurate. The first proposal of an edge coefficient in this paper helps to describe the edge effect with better accuracy. Accurate equivalent magnetic circuit (EMC) models of the APMC are established for each region. Models of magnetic flux, magnetic resistance, and eddy current density are established by defining the equivalent dimensional parameters of the eddy current circuit. Furthermore, the concept of magnetic inductance is proposed for the first time, parameterizing eddy currents that are difficult to describe with physical models and achieving the modeling of the dynamic eddy current circuit. The magnetic resistance is subdivided into two parts corresponding to the output and slip according to the power relationship. Furthermore, eddy current loss and dynamic torque models are further derived. The method proposed in this paper enables the APMC to be modeled and calculated in a completely new way. The correctness and accuracy of the model have been fully demonstrated using finite element simulation and an experimental prototype. In addition, the limitations of the proposed method and the reasons are fully discussed and investigated. [ABSTRACT FROM AUTHOR]

In the field of image watermarking, imperceptibility, robustness, and watermarking capacity are key indicators for evaluating the performance of watermarking techniques. However, these three factors are often mutually constrained, posing a challenge in achieving a balance among them. To address this issue, this paper presents a novel image watermark detection algorithm based on local fast and accurate polar harmonic Fourier moments (FAPHFMs) and the BKF–Rayleigh distribution model. Firstly, the original image is chunked without overlapping, the entropy value is calculated, the high-entropy chunks are selected in descending order, and the local FAPHFM magnitudes are calculated. Secondly, the watermarking signals are embedded into the robust local FAPHFM magnitudes by the multiplication function, and then MMLE based on the RSS method is utilized to estimate the statistical parameters of the BKF–Rayleigh distribution model. Finally, a blind image watermarking detector is designed using BKF–Rayleigh distribution and LO decision criteria. In addition, we derive the closed expression of the watermark detector using the BKF–Rayleigh model. The experiments proved that the algorithm in this paper outperforms the existing methods in terms of performance, maintains robustness well under a large watermarking capacity, and has excellent imperceptibility at the same time. The algorithm maintains a well-balanced relationship between robustness, imperceptibility, and watermarking capacity. [ABSTRACT FROM AUTHOR]

The present paper addresses linear parameter-varying systems with high-order time-varying parameter dependency known as polynomial LPV systems and their controller design. Throughout this work, a procedure ensuring a state-feedback controller from a parameterized linear matrix inequality (PLMI) solution is presented. As the main contribution of this paper, the controller is designed by considering the time-varying parameter rate as a tuning parameter with a continuous control gain in such a way that the closed-loop eigenvalues lie in a complex plane subset, with high-order time-varying parameters defining the system dynamics. Simulation results are presented, aiming to show the effectiveness of the proposed controller design. [ABSTRACT FROM AUTHOR]

This paper studies the application of artificial intelligence to milling machines, focusing specifically on identifying the inputs (features) required for predicting surface roughness. Previous studies have extensively reviewed and presented useful features for surface roughness prediction. However, applying research findings to actual operational factories can be challenging due to the additional costs of sensor installations and the diverse environments present in each factory setting. To address these issues, in this paper, we introduced effective features for predicting surface roughness in situations where additional sensors are not installed in the existing environment. These features include feed per tooth,  F z ; material removal rate, Q; and the load information. These features are suitable for use in highly constrained environments where separate sensor installation is not required, making it possible to apply the research findings in various factory environments. Additionally, to efficiently select the optimal subset for surface roughness prediction among subsets formed by available features, we apply causality to the feature selection method, proposing an approach called causality-driven efficient feature selection. The experimental results demonstrate that the features introduced in this paper are quite suitable for predicting surface roughness and that the proposed feature selection approach is more effective and efficient compared to existing selection methods. [ABSTRACT FROM AUTHOR]

This review paper gives an overview of the method of multipliers for partial differential equations (PDEs). This method has made possible a lot of solutions to PDEs that are of interest in many areas such as applied mathematics, mathematical physics, engineering, etc. Looking at the history of the method and synthesizing the newest developments, we hope to give it the attention that it deserves to help develop the vast amount of work still needed to understand it and make the best use of it. It is also an interesting and a relevant method in itself that could possibly give interesting results in areas of mathematics such as modern algebra, group theory, topology, etc. The paper will be structured in such a manner that the last review known for this method will be presented to understand the theoretical framework of the method and then later work done will be presented. The information of four recent papers further developing the method will be synthesized and presented in such a manner that anyone interested in learning this method will have the most relevant information available and have all details cited for checking. [ABSTRACT FROM AUTHOR]

As the ownership of electric vehicles (EVs) continues to rise, EVs are becoming an integral part of urban microgrids. Incorporating the charging and discharging processes of EVs into the microgrid's optimization scheduling process can serve to load leveling, reducing the reliance of the microgrid on external power networks. This paper proposes a novel two-stage, dual-layer distributed optimization operational approach for microgrids with EVs. The lower layer is a distributed control layer, which ensures, through consensus control methods, that every EV maintains a consistent charging/discharging and state of charge (SOC). The upper layer is the optimization scheduling layer, determining the optimal operational strategy of the microgrid using the multiagent reinforcement learning method and providing control reference signals for the lower layer. Additionally, this paper categorizes the charging process of EVs into two stages based on their SOC: the constrained scheduling stage and the free scheduling stage. By employing distinct control methods during these two stages, we ensure that EVs can participate in the microgrid scheduling while fully respecting the charging interests of the EV owners. [ABSTRACT FROM AUTHOR]

Path-planning research has been the key to mobile-robot-navigation technology. However, traditional path-planning algorithms have some shortcomings. To solve these problems, this paper proposes a fusion algorithm that combines the kinematical constrained A* algorithm with the Dynamic Window Approach (DWA) algorithm. The kinematical constrained A* algorithm can plan the global path, and then the DWA algorithm can plan the local path under the global path's guidance. Firstly, combined with robot kinematics, we improve the node-expansion method and heuristic-function model of the A* algorithm, which improves the search efficiency, reduces the number of path bends and lowers the computational cost so that the path generated by the A* algorithm better meets the needs of robot motion. Secondly, we optimize the trajectory-evaluation function of the DWA algorithm so that the local paths planned by the DWA algorithm are smoother and more coherent, which is easier for robot-motion execution. Finally, we extract the key nodes from the global path planned by the A* algorithm to guide the DWA algorithm for local path planning and dynamic-obstacle avoidance and to make the local path closer to the global path. Through simulation and practical experiments, the effectiveness of the fusion algorithm proposed in this paper is verified. [ABSTRACT FROM AUTHOR]

This paper aims to present a methodology for the application of matching methods in industry to measure causal effect size. Matching methods allow us to obtain treatment and control samples with their covariates as similar as possible. The matching techniques used are nearest, optimal, full, coarsened exact matching (CEM), and genetic. These methods have been widely used in medical, psychological, and economic sciences. The proposed methodology provides two algorithms to execute these methods and to conduct an exhaustive search for the best models. It uses three conditions to ensure, as far as possible, the balance of all covariates, the maximum number of units in the treatment and control groups, and the most significant causal effect sizes. These techniques are applied in the carton board industry, where the causal variable is downtime, and the outcome variable is waste generated. A dataset from the carton board industry is used, and the results are contrasted with an expert in this process. Meta-analysis techniques are used to integrate the results of different comparative studies, which could help to determine and prioritize where to reduce waste. Two machines were found to generate more waste in terms of standardized measures whose values are 0.52 and 0.53, representing 48.60 and 36.79 linear meters (LM) on average for each production order with a total downtime of more than 3000 s. In general, for all machines, the maximum average wastage for each production order is 24.98 LM and its confidence interval is [13.40;36.23] LM. The main contribution of this work is the use of causal methodology to estimate the effect of downtime on waste in an industry. Particularly relevant is the contribution of an algorithm that aims to obtain the best matching model for this application. Its advantages and disadvantages are evaluated, and future areas of research are outlined. We believe that this methodology can be applied to other industries and fields of knowledge. [ABSTRACT FROM AUTHOR]

Many optimization mathematical models, associated with the technical-economic processes of real-world problems, have elements of uncertainty in their structure, which places them in stochastic optimization programming. Their diversity and complexity, due to the large uncertainty space, require special methods of solving, because there is no general solution method. Within this context, in this paper we consider the category of optimization models that can contain random variable type coefficients and/or imposed probability levels on the constraints. The purpose of the paper is to propose a methodology dedicated to these studied models. Applying the methodology leads to developing a deterministic linear programming model, associated with the initial stochastic model. In fact, the proposed methodology reduces the stochastic formulation to a deterministic formulation. The methodology is illustrated with a numerical case study based on a manufacturing problem. Solving the obtained deterministic model is carried out in the version assisted by a specialized software product (WinQSB Version 2.0). It allows for the performing of a sensitivity analysis of the optimal solution, and/or a parametric analysis relative to certain model coefficients, both also presented in the paper. The main result of the study in this paper is the proposed methodology, which is applicable on a large scale, for any mathematical model of stochastic optimization of the mentioned type, regardless of complexity, dimensions and the domain of the process to which it is associated. The numerical results obtained when applying this methodology indicate its efficiency and effectiveness in finding the solution for the studied models. The approach to this issue in the present paper is determined by the wide range of stochastic optimization problems in the various studied real-life processes and by the imperative need to adopt the best decisions in conditions of uncertainty. [ABSTRACT FROM AUTHOR]

In recent years, construction engineering technology has been developing rapidly, and the application of curtain walls inside modern buildings is also increasing. However, with the increasing number of curtain wall orders, most factories are facing challenges in the market due to low productivity caused by a low balance rate of curtain wall production lines. This paper is useful in improving the balance rate of the curtain wall production line; firstly, we use the improved genetic algorithm to obtain the optimal sequencing scheme of the curtain wall production line. Then, the optimization plan is validated through FLEXSIM simulation, and the results show that the device utilization rate of each workstation reaches 80%. Finally, this paper designs an intelligent production factory for curtain walls, and then builds an intelligent production line for curtain wall columns for experiments. The experimental results show that the workstation operation time has been reduced from 360 s to 300 s; the production line balance rate has increased from 57.04% to 91.60%. Therefore, it can be concluded that the modified genetic algorithm is valid in improving the balance rate of curtain wall production lines and raising the production efficiency of enterprises. [ABSTRACT FROM AUTHOR]

The long queuing time for electric vehicles to charge under intelligent network connection leads to low distribution efficiency. Therefore, this paper proposes a strategy to predict the probability of queues forming for electric vehicles arriving at charging stations under intelligent network connection. Both the dynamic demand of customers and the characteristics of the alternating influence of charging vehicles should be considered when studying such problems. Based on the above problem characteristics, a real-time dynamic charging selection strategy is developed by predicting the probability of other vehicles in the region going to the charging station. A distribution path optimization model based on intelligent network connection and queuing theory is proposed for electric logistics vehicles in charging mode, taking into account the time window constraint and the influence of charging vehicles when using intelligent network connection for path planning. The objective is to minimize the total cost, and the route for electric logistics vehicles is adjusted in real time. This is solved by an improved hybrid genetic-annealing algorithm. The experimental results show that this paper obtains real-time dynamic road information and charging information with the help of intelligent network connection. It predicts the queuing probability of electric vehicles by combining with queuing theory, which can help select a more suitable charging location and timing for electric logistics vehicles. This can effectively avoid peak periods and reduce waiting times. By comparing with other models, this paper's model can save the distribution cost of electric vehicles. [ABSTRACT FROM AUTHOR]

This study aims to understand the development trends and research structure of articles on artificial intelligence (AI) and information processing in the past 10 years. In particular, this study analyzed 13,294 papers published from 2012 to 2021 in the Web of Science, used the bibliometric analysis method to visualize the data of the papers, and drew a scientific knowledge map. By exploring the development of mainstream journals, author and country rankings, keyword evolution, and research field rankings in the past 10 years, this study uncovered key trends affecting AI progress and information processing that provide insights and serve as an important reference for future AI research and information processing. The results revealed a gradual increase in publications over the past decade, with explosive growth after 2020. The most prolific researchers in this field were Xu, Z.S.; Pedrycz, W.; Herrera-Viedma, E.; the major contributing countries were China, the USA, and Spain. In the AI and information processing research, keywords including "Deep learning", "Machine learning", and "Feature extraction" are components that play a crucial role. Additionally, the most representative research areas were "Engineering", "Operations Research and Management Science", and "Automation Control Systems". Overall, this study used bibliometric analysis to provide an overview of the latest trends in artificial intelligence and information processing. Although AI and information processing have been applied to various research areas, many other sub-topics can be further applied. Based on the findings, this study presented research insights and proposed suggestions for future research directions on AI and information processing. [ABSTRACT FROM AUTHOR]

The frequent variations of XSS (cross-site scripting) payloads make static and dynamic analysis difficult to detect effectively. In this paper, we proposed a fusion verification method that combines traffic detection with XSS payload detection, using machine learning to detect XSS attacks. In addition, we also proposed seven new payload features to improve detection efficiency. In order to verify the effectiveness of our method, we simulated and tested 20 public CVE (Common Vulnerabilities and Exposures) XSS attacks. The experimental results show that our proposed method has better accuracy than the single traffic detection model. Among them, the recall rate increased by an average of 48%, the F1 score increased by an average of 27.94%, the accuracy rate increased by 9.29%, and the accuracy rate increased by 3.81%. Moreover, the seven new features proposed in this paper account for 34.12% of the total contribution rate of the classifier. [ABSTRACT FROM AUTHOR]

As the finite nature of non-renewable energy resources is realised and climate change concerns become more prevalent, the need to shift to more sustainable forms of energy such as the adoption of renewable energy has seen an increase. More specifically, wind energy conversion systems (WECS) have become increasingly important as a contribution to grid frequency support, to maintain power at the nominal frequency and mitigate power failures or supply shortages against demand. Therefore, limiting deviations in frequency is imperative and, thus, the control methods of WECS are called to be investigated. The systematic literature review methodology was used and aimed at investigating these control methods used by WECS, more specifically variable-speed wind turbines (VSWT), in supporting grid frequency as well as the limitations of such methods. The paper identifies these to be de-loading, energy storage systems and emulated inertial response. Further classification of these is presented regarding these control methods, which are supported by literature within period of 2015–2022. The literature indicated a persistent interest in this field; however, a few limitations of VSWTS were identified. The emulated inertial response, specifically using a droop control-based frequency support scheme, was the primary means of providing frequency support. This systematic literature review may be limited by the number of papers selected for the study. Results and conclusions will not only be useful for WECS development but also in assisting with the security of the transmission grid's frequency stability. Future work will focus on further studying the limitations of WECS providing frequency support. [ABSTRACT FROM AUTHOR]

When a machine tool is used for a long time, its bearing experiences wear and failure due to heat and vibration, resulting in damage to the machine tool. In order to make the machine tool stable for processing, this paper proposes a smart bearing diagnosis system (SBDS), which uses a gradient-weighted class activation mapping (Grad-CAM)-based convolutional neuro-fuzzy network (GC-CNFN) to detect the bearing status of the machine tool. The developed GC-CNFN is composed of a convolutional layer and neuro-fuzzy network. The convolutional layer can automatically extract vibration signal features, which are then classified using the neuro-fuzzy network. Moreover, Grad-CAM is used to analyze the attention of the diagnosis model. To verify the performance of bearing fault classification, the 1D CNN (ODCNN) and improved 1D LeNet-5 (I1DLeNet) were adopted to compare with the proposed GC-CNFN. Experimental results showed that the proposed GC-CNFN required fewer parameters (20K), had a shorter average calculation time (117.7 s), and had a higher prediction accuracy (99.88%) in bearing fault classification. The proposed SBDS can not only accurately classify bearing faults, but also help users understand the current status of the machine tool. [ABSTRACT FROM AUTHOR]

The problem of insufficient signal coverage of 5G base stations can be solved by building new base stations in areas with weak signal coverage. However, due to construction costs and other factors, it is not possible to cover all areas. In general, areas with high traffic and weak coverage should be given priority. Although many scientists have carried out research, it is not possible to make the large-scale calculation accurately due to the lack of data support. It is necessary to search for the central point through continuous hypothesis testing, so there is a large systematic error. In addition, it is difficult to give a unique solution. In this paper, the weak signal coverage points were divided into three categories according to the number of users and traffic demand. With the lowest cost as the target, and constraints such as the distance requirement of base station construction, the proportion of the total signal coverage business, and so on, a single objective nonlinear programming model was established to solve the base station layout problem. Through traversal search, the optimal threshold of the traffic and the number of base stations was obtained, and then, a kernel function was added to the mean shift clustering algorithm. The center point of the new macro station was determined in the dense area, the location of the micro base station was determined from the scattered and abnormal areas, and finally the unique optimal planning scheme was obtained. Based on the assumptions made in this paper, the minimum total cost is 3752 when the number of macro and micro base stations were determined to be 31 and 3442 respectively, and the signal coverage rate can reach 91.43%. Compared with the existing methods, such as K-means clustering, K-medoids clustering, and simulated annealing algorithms, etc., the method proposed in this paper can achieve good economic benefits; when the traffic threshold and the number of base stations threshold are determined, the unique solution can be obtained. [ABSTRACT FROM AUTHOR]

The work in this paper helps study cardiac rhythms and the electrical activity of the heart for two of the most critical cardiac arrhythmias. Various consumer devices exist, but implementation of an appropriate device at a certain position on the body at a certain pressure point containing an enormous number of blood vessels and developing filtering techniques for the most accurate signal extraction from the heart is a challenging task. In this paper, we provide evidence of prediction and analysis of Atrial Fibrillation (AF) and Ventricular Fibrillation (VF). Long-term monitoring of diseases such as AF and VF occurrences is very important, as these will lead to occurrence of ischemic stroke, cardiac arrest and complete heart failure. The AF and VF signal classification accuracy are much higher when processed on a Graphics Processor Unit (GPU) than Central Processing Unit (CPU) or traditional Holter machines. The classifier COMMA-Z filter is applied to the highly-sensitive industry certified Bio PPG sensor placed at the earlobe and computed on GPU. [ABSTRACT FROM AUTHOR]

Abnormal passenger behavior in rail transit has become a top priority, as it affects operational safety. Passenger travel time is the main basis for identifying abnormal behavior while considering the flexibility of travel time. Currently, the main method is to use absolute threshold discrimination based on the distribution of travel time. However, there is a problem of missing abnormal passenger behavior due to the large difference in travel time between the Origin-Destinations (ODs). Therefore, this paper proposes a method of setting corresponding thresholds for each OD. By analyzing the percentile curves of the overall and individual OD pairs, it was found that the turning point of the curve had a significant feature, and the difference between the two sides of the curve was obvious. This paper proposes a bilateral fitting method, and the results show that this method can calculate the relative threshold for different OD pairs. The significant advantages of this method are its low cost and wide coverage. [ABSTRACT FROM AUTHOR]

The paper firstly establishes the so-called n-times iterated connected sum of a simple closed k-surface in Z 3 , denoted by C k n , k ∈ { 6 , 18 , 26 } . Secondly, for a simple closed 18-surface M S S 18 , we prove that there are only two types of connected sums of it up to 18-isomorphism. Besides, given a simple closed 6-surface M S S 6 , we prove that only one type of M S S 6 ♯ M S S 6 exists up to 6-isomorphism, where ♯ means the digital connected sum operator. Thirdly, we prove the digital k-contractibility of C k n : = M S S k ♯ ⋯ ♯ M S S k ⏞ n − times , k ∈ { 18 , 26 } , which leads to the simply k-connectedness of C k n , k ∈ { 18 , 26 } , n ∈ N . Fourthly, we prove that C 6 2 and C k n do not have the almost fixed point property (AFPP, for short), k ∈ { 18 , 26 } . Finally, assume a closed k-surface S k (⊂ Z 3) which is (k , k ¯) -isomorphic to (X , k) in the picture (Z 3 , k , k ¯ , X) and the set X is symmetric according to each of x y -, y z -, and x z -planes of R 3 . Then we prove that S k does not have the AFPP. In this paper given a digital image (X , k) is assumed to be k-connected and its cardinality | X | ≥ 2 . [ABSTRACT FROM AUTHOR]

This paper develops a digital supply chain game, modeling marketing and operation interactions between members. The main novelty of the paper concerns a comparison between static and dynamic solutions of the supply chain game achieved when moving from traditional to digital platforms. Therefore, this study proposes centralized and decentralized versions of the game, comparing their solutions under static and dynamic settings. Moreover, it investigates the decentralized supply chain by evaluating two smart contracts: Revenue sharing and wholesale price contracts. In both cases, the firms use an artificial intelligence system to determine the optimal contract parameters. Numerical and qualitative analyses are used for comparing configurations (centralized, decentralized), settings (static, dynamic), and contract schemes (revenue sharing contract, wholesale price contract). The findings identify the conditions under which smart revenue sharing mechanisms are worth applying. [ABSTRACT FROM AUTHOR]

In comparison with other respiratory viruses, the current COVID-19 pandemic's rapid seizing the world can be attributed to indirect (contact) way of transmission of SARS-CoV-2 virus in addition to the regular airborne way. A significant part of indirect transmission is made through cash bank notes. SARS-CoV-2 remains on cash paper money for period around four times larger than influenza A virus and is absorbed by cash notes two and a half times more effectively than influenza A (our model). During the pandemic, cryptocurrencies have gained attractiveness as an "epidemiologically safe" means of transactions. On the basis of the authors' gallop polls performed online with social networks users in 44 countries in 2020–2021 (the total number of clear responses after the set repair 32,115), around 14.7% of surveyed participants engaged in cryptocurrency-based transactions during the pandemic. This may be one of the reasons of significant rise of cryptocurrencies rates since mid-March 2020 till the end of 2021. The paper discusses the reasons for cryptocurrency attractiveness during the COVID-19 pandemic. Among them, there are fear of SARS-CoV-2 spread via cash contacts and the ability of the general population to mine cryptocurrencies. The article also provides a breakdown of the polled audience profile to determine the nationalities that have maximal level of trust to saving and transacting money as cryptocurrencies. [ABSTRACT FROM AUTHOR]

As a new abstract computational model in evolutionary transfer optimization (ETO), single-objective to multi-objective optimization (SMO) is conducted at the macroscopic level rather than the intermediate level for specific algorithms or the microscopic level for specific operators; this method aims to develop systems with a profound grasp of evolutionary dynamic and learning mechanism similar to human intelligence via a "decomposition" style (in the abstract of the well-known "Transformer" article "Attention is All You Need", they use "attention" instead). To the best of our knowledge, it is the first work of SMO for discrete cases because we extend our conference paper and inherit its originality status. In this paper, by implementing the abstract SMO in specialized memetic algorithms, key knowledge from single-objective problems/tasks to the multi-objective core problem/task can be transferred or "gathered" for permutation flow shop scheduling problems, which will reduce the notorious complexity in combinatorial spaces for multi-objective settings in a straight method; this is because single-objective tasks are easier to complete than their multi-objective versions. Extensive experimental studies and theoretical results on benchmarks (1) emphasize our decomposition root in mathematical programming, such as Lagrangian relaxation and column generation; (2) provide two "where to go" strategies for both SMO and ETO; and (3) contribute to the mission of building safe and beneficial artificial general intelligence for manufacturing via evolutionary computation. [ABSTRACT FROM AUTHOR]

Based on the unwinding problem caused by the dual valued property of the quaternion description method, this paper designs an anti-unwinding sliding mode adaptive attitude tracking control with external disturbances and inertia matrix uncertainty. The sliding mode surface used in this paper contains two equilibrium points and adopts an indirect method, which greatly reduces the computational complexity. The stability and anti-unwinding performance have been proven. The simulation results have verified the effectiveness of the control method and we have compared it with the general linear sliding mode. The results show that the control method proposed in this paper is more stable, has higher convergence accuracy and has anti-unwinding performance. [ABSTRACT FROM AUTHOR]

With the continuous development of artificial intelligence technology and the exponential growth in the number of images, image detection and recognition technology is becoming more widely used. Image knowledge management is extremely urgent. The data source of a knowledge graph is not only the text and structured data but also the visual or auditory data such as images, video, and audio. How to use multimodal information to build an information management platform is a difficult problem. In this paper, a method is proposed to construct the result of image recognition as a knowledge graph. First of all, based on the improvement in the BlendMASK algorithm, the hollow convolution kernel is added. Secondly, the effect of image recognition and the relationships between all kinds of information are analyzed. Finally, the image knowledge graph is constructed by using the relationship between the image entities. The contributions of this paper are as follows. (1) The hollow convolution kernel is added to reduce the loss from extracting feature information from high-level feature images. (2) In this paper, a method is proposed to determine the relationship between entities by dividing the recognition results of entities in an image with a threshold, which makes it possible for the relationships between images to be interconnected. The experimental results show that this method improves the accuracy and F1 value of the image recognition algorithm. At the same time, the method achieves integrity in the construction of a multimodal knowledge graph. [ABSTRACT FROM AUTHOR]

Predicting particulate matter with a diameter of 10 μm (PM10) is crucial due to its impact on human health and the environment. Today, aerosol optical depth (AOD) offers high resolution and wide coverage, making it a viable way to estimate PM concentrations. Recent years have also witnessed in-creasing promise in refining air quality predictions via deep neural network (DNN) models, out-performing other techniques. However, learning the weights and biases of the DNN is a task classified as an NP-hard problem. Current approaches such as gradient-based methods exhibit significant limitations, such as the risk of becoming ensnared in local minimal within multi-objective loss functions, substantial computational requirements, and the requirement for continuous objective functions. To tackle these challenges, this paper introduces a novel approach that combines the binary gray wolf optimizer (BGWO) with DNN to improve the optimization of models for air pollution prediction. The BGWO algorithm, inspired by the behavior of gray wolves, is used to optimize both the weight and bias of the DNN. In the proposed BGWO, a novel sigmoid function is proposed as a transfer function to adjust the position of the wolves. This study gathers meteorological data, topographic information, PM10 pollution data, and satellite images. Data preparation includes tasks such as noise removal and handling missing data. The proposed approach is evaluated through cross-validation using metrics such as correlation rate, R square, root-mean-square error (RMSE), and accuracy. The effectiveness of the BGWO-DNN framework is compared to seven other machine learning (ML) models. The experimental evaluation of the BGWO-DNN method using air pollution data shows its superior performance compared with traditional ML techniques. The BGWO-DNN, CapSA-DNN, and BBO-DNN models achieved the lowest RMSE values of 16.28, 19.26, and 20.74, respectively. Conversely, the SVM-Linear and GBM algorithms displayed the highest levels of error, yielding RMSE values of 36.82 and 32.50, respectively. The BGWO-DNN algorithm secured the highest R2 (88.21%) and accuracy (93.17%) values, signifying its superior performance compared with other models. Additionally, the correlation between predicted and actual values shows that the proposed model surpasses the performance of other ML techniques. This paper also observes relatively stable pollution levels during spring and summer, contrasting with significant fluctuations during autumn and winter. [ABSTRACT FROM AUTHOR]

The tension between city logistics and its impact on sustainable urban development is evident. Often, local environmental decisions overlook the effects on urban freight logistics, lacking consideration for stakeholders. To address this, utilizing multi-criteria analysis becomes relevant for informed urban planning and management decision making. In this context, this paper conducts a systematic literature review from 2012 to 2022, focused on implementing the multi-criteria analysis methodology to evaluate alternatives for solutions in urban freight logistics. The PRISMA tool was used in the review to select publications and categorize the information obtained to address the research questions. Results display the most prominent authors and publications, authors' country affiliations, annual publication frequency, research objectives, used frameworks, involved actors, defined evaluation criteria, types of alternatives for solutions considered, and MCDM methods applied. The main finding is that the most commonly used MCDM methods were AHP hybrid followed by MAMCA. In addition, no clear correlation between the pursued objectives and the MCDM methods employed by the researchers is identified. It is important to note that all publications with the highest number of citations use fuzzy methods in their analyses. [ABSTRACT FROM AUTHOR]