Data-Driven Learning Control Algorithms for Unachievable Tracking Problems

For unachievable tracking problems, where the system output cannot precisely track a given reference, achieving the best possible approximation for the reference trajectory becomes the objective. This study aims to investigate solutions using the Ptype learning control scheme. Initially, we demonstrate the necessity of gradient information for achieving the best approximation.Subsequently, we propose an input-output-driven learning gain design to handle the imprecise gradients of a class of uncertain systems. However, it is discovered that the desired performance may not be attainable when faced with incomplete information.To address this issue, an extended iterative learning control scheme is introduced. In this scheme, the tracking errors are modified through output data sampling, which incorporates lowmemory footprints and offers flexibility in learning gain design.The input sequence is shown to converge towards the desired input, resulting in an output that is closest to the given reference in the least square sense. Numerical simulations are provided to validate the theoretical findings.

Data-driven casting defect prediction model for sand casting based on random forest classification algorithm

The complex sand-casting process combined with the interactions between process parameters makes it difficult to control the casting quality,resulting in a high scrap rate.A strategy based on a data-driven model was proposed to reduce casting defects and improve production efficiency,which includes the random forest(RF)classification model,the feature importance analysis,and the process parameters optimization with Monte Carlo simulation.The collected data includes four types of defects and corresponding process parameters were used to construct the RF model.Classification results show a recall rate above 90% for all categories.The Gini Index was used to assess the importance of the process parameters in the formation of various defects in the RF model.Finally,the classification model was applied to different production conditions for quality prediction.In the case of process parameters optimization for gas porosity defects,this model serves as an experimental process in the Monte Carlo method to estimate a better temperature distribution.The prediction model,when applied to the factory,greatly improved the efficiency of defect detection.Results show that the scrap rate decreased from 10.16% to 6.68%.

A review of data-driven whole-life state of health prediction for lithium-ion batteries:Data preprocessing,aging characteristics,algorithms,and future challenges

Lithium-ion batteries are the preferred green energy storage method and are equipped with intelligent battery management systems(BMSs)that efficiently manage the batteries.This not only ensures the safety performance of the batteries but also significantly improves their efficiency and reduces their damage rate.Throughout their whole life cycle,lithium-ion batteries undergo aging and performance degradation due to diverse external environments and irregular degradation of internal materials.This degradation is reflected in the state of health(SOH)assessment.Therefore,this review offers the first comprehensive analysis of battery SOH estimation strategies across the entire lifecycle over the past five years,highlighting common research focuses rooted in data-driven methods.It delves into various dimensions such as dataset integration and preprocessing,health feature parameter extraction,and the construction of SOH estimation models.These approaches unearth hidden insights within data,addressing the inherent tension between computational complexity and estimation accuracy.To enha nce support for in-vehicle implementation,cloud computing,and the echelon technologies of battery recycling,remanufacturing,and reuse,as well as to offer insights into these technologies,a segmented management approach will be introduced in the future.This will encompass source domain data processing,multi-feature factor reconfiguration,hybrid drive modeling,parameter correction mechanisms,and fulltime health management.Based on the best SOH estimation outcomes,health strategies tailored to different stages can be devised in the future,leading to the establishment of a comprehensive SOH assessment framework.This will mitigate cross-domain distribution disparities and facilitate adaptation to a broader array of dynamic operation protocols.This article reviews the current research landscape from four perspectives and discusses the challenges that lie ahead.Researchers and practitioners can gain a comprehensive understanding of battery SOH estimation methods,offering valuable insights for the development of advanced battery management systems and embedded application research.

Unleashing the Power of Multi-Agent Reinforcement Learning for Algorithmic Trading in the Digital Financial Frontier and Enterprise Information Systems

In the rapidly evolving landscape of today’s digital economy,Financial Technology(Fintech)emerges as a trans-formative force,propelled by the dynamic synergy between Artificial Intelligence(AI)and Algorithmic Trading.Our in-depth investigation delves into the intricacies of merging Multi-Agent Reinforcement Learning(MARL)and Explainable AI(XAI)within Fintech,aiming to refine Algorithmic Trading strategies.Through meticulous examination,we uncover the nuanced interactions of AI-driven agents as they collaborate and compete within the financial realm,employing sophisticated deep learning techniques to enhance the clarity and adaptability of trading decisions.These AI-infused Fintech platforms harness collective intelligence to unearth trends,mitigate risks,and provide tailored financial guidance,fostering benefits for individuals and enterprises navigating the digital landscape.Our research holds the potential to revolutionize finance,opening doors to fresh avenues for investment and asset management in the digital age.Additionally,our statistical evaluation yields encouraging results,with metrics such as Accuracy=0.85,Precision=0.88,and F1 Score=0.86,reaffirming the efficacy of our approach within Fintech and emphasizing its reliability and innovative prowess.

Harnessing the Power of Artificial Intelligence in Neuromuscular Disease Rehabilitation: A Comprehensive Review and Algorithmic Approach

Neuromuscular diseases present profound challenges to individuals and healthcare systems worldwide, profoundly impacting motor functions. This research provides a comprehensive exploration of how artificial intelligence (AI) technology is revolutionizing rehabilitation for individuals with neuromuscular disorders. Through an extensive review, this paper elucidates a wide array of AI-driven interventions spanning robotic-assisted therapy, virtual reality rehabilitation, and intricately tailored machine learning algorithms. The aim is to delve into the nuanced applications of AI, unlocking its transformative potential in optimizing personalized treatment plans for those grappling with the complexities of neuromuscular diseases. By examining the multifaceted intersection of AI and rehabilitation, this paper not only contributes to our understanding of cutting-edge advancements but also envisions a future where technological innovations play a pivotal role in alleviating the challenges posed by neuromuscular diseases. From employing neural-fuzzy adaptive controllers for precise trajectory tracking amidst uncertainties to utilizing machine learning algorithms for recognizing patient motor intentions and adapting training accordingly, this research encompasses a holistic approach towards harnessing AI for enhanced rehabilitation outcomes. By embracing the synergy between AI and rehabilitation, we pave the way for a future where individuals with neuromuscular disorders can access tailored, effective, and technologically-driven interventions to improve their quality of life and functional independence.

Algorithmic approach to discrete fracture network flow modeling in consideration of realistic connections in large-scale fracture networks

Analyzing rock mass seepage using the discrete fracture network(DFN)flow model poses challenges when dealing with complex fracture networks.This paper presents a novel DFN flow model that incorporates the actual connections of large-scale fractures.Notably,this model efficiently manages over 20,000 fractures without necessitating adjustments to the DFN geometry.All geometric analyses,such as identifying connected fractures,dividing the two-dimensional domain into closed loops,triangulating arbitrary loops,and refining triangular elements,are fully automated.The analysis processes are comprehensively introduced,and core algorithms,along with their pseudo-codes,are outlined and explained to assist readers in their programming endeavors.The accuracy of geometric analyses is validated through topological graphs representing the connection relationships between fractures.In practical application,the proposed model is employed to assess the water-sealing effectiveness of an underground storage cavern project.The analysis results indicate that the existing design scheme can effectively prevent the stored oil from leaking in the presence of both dense and sparse fractures.Furthermore,following extensive modification and optimization,the scale and precision of model computation suggest that the proposed model and developed codes can meet the requirements of engineering applications.

Data-Driven Heuristic Assisted Memetic Algorithm for Efficient Inter-Satellite Link Scheduling in the BeiDou Navigation Satellite System

Inter-satellite link(ISL)scheduling is required by the BeiDou Navigation Satellite System(BDS)to guarantee the system ranging and communication performance.In the BDS,a great number of ISL scheduling instances must be addressed every day,which will certainly spend a lot of time via normal metaheuristics and hardly meet the quick-response requirements that often occur in real-world applications.To address the dual requirements of normal and quick-response ISL schedulings,a data-driven heuristic assisted memetic algorithm(DHMA)is proposed in this paper,which includes a high-performance memetic algorithm(MA)and a data-driven heuristic.In normal situations,the high-performance MA that hybridizes parallelism,competition,and evolution strategies is performed for high-quality ISL scheduling solutions over time.When in quick-response situations,the data-driven heuristic is performed to quickly schedule high-probability ISLs according to a prediction model,which is trained from the high-quality MA solutions.The main idea of the DHMA is to address normal and quick-response schedulings separately,while high-quality normal scheduling data are trained for quick-response use.In addition,this paper also presents an easy-to-understand ISL scheduling model and its NP-completeness.A seven-day experimental study with 10080 one-minute ISL scheduling instances shows the efficient performance of the DHMA in addressing the ISL scheduling in normal(in 84 hours)and quick-response(in 0.62 hour)situations,which can well meet the dual scheduling requirements in real-world BDS applications.

Optimization Design of Fairings for VIV Suppression Based on Data-Driven Models and Genetic Algorithm

Vortex induced vibration(VIV)is a challenge in ocean engineering.Several devices including fairings have been designed to suppress VIV.However,how to optimize the design of suppression devices is still a problem to be solved.In this paper,an optimization design methodology is presented based on data-driven models and genetic algorithm(GA).Data-driven models are introduced to substitute complex physics-based equations.GA is used to rapidly search for the optimal suppression device from all possible solutions.Taking fairings as example,VIV response database for different fairings is established based on parameterized models in which model sections of fairings are controlled by several control points and Bezier curves.Then a data-driven model,which can predict the VIV response of fairings with different sections accurately and efficiently,is trained through BP neural network.Finally,a comprehensive optimization method and process is proposed based on GA and the data-driven model.The proposed method is demonstrated by its application to a case.It turns out that the proposed method can perform the optimization design of fairings effectively.VIV can be reduced obviously through the optimization design.

Algorithmic Optimization of BDDs and Performance Evaluation for Multi-level Logic Circuits with Area and Power Trade-offs

Binary Decision Diagrams (BDDs) can be graphically manipulated to reduce the number of nodes and hence the area. In this context, ordering of BDDs play a major role. Most of the algorithms for input variable ordering of OBDD focus primarily on area minimization. However, suitable input variable ordering helps in minimizing the power consumption also. In this particular work, we have proposed two algorithms namely, a genetic algorithm based technique and a branch and bound algorithm to find an optimal input variable order. Of course, the node reordering is taken care of by the standard BDD package buddy-2.4. Moreover, we have evaluated the performances of the proposed algorithms by running an exhaustive search program. Experi-mental results show a substantial saving in area and power. We have also compared our techniques with other state-of-art techniques of variable ordering for OBDDs and found to give superior results.

Nonlinear Model Algorithmic Control of a pH Neutralization Process

Control of pH neutralization processes is challenging in the chemical process industry because of their inherent strong nonlinearity. In this paper, the model algorithmic control (MAC) strategy is extended to nonlinear processes using Hammerstein model that consists of a static nonlinear polynomial function followed in series by a linear impulse response dynamic element. A new nonlinear Hammerstein MAC algorithm (named NLH-MAC) is presented in detail. The simulation control results of a pH neutralization process show that NLH-MAC gives better control performance than linear MAC and the commonly used industrial nonlinear propotional plus integral plus derivative (PID) controller. Further simulation experiment demonstrates that NLH-MAC not only gives good control response, but also possesses good stability and robustness even with large modeling errors.

Radiological Mimics of Popliteal Cysts: An Algorithmic Approach Using US and MRI to Identify the Potentially Malignant Lesions: Case Series

Background: Popliteal cysts are common and present as asymptomatic lumps in the medial popliteal fossa. Some have complex internal characteristics such as septa and loose-bodies. However, not all are popliteal cysts and can be aggressive. These lesions need to be differentiated by the absence of the communicating neck with the joint on ultrasound. Presence of Doppler flow of non-communicating cysts requires further evaluation on MRI, prior to performing a biopsy. Using a case series, we propose an algorithmic approach that is simple and will help identify the malignant lesions and institute appropriate management. Case-Presentation: Popliteal Cyst: On ultrasound: characteristic neck communicating with knee joint. Synovial Sarcoma: Gadolinium enhancement, with areas of low-, iso- and hyper-intense signal to fat on T2. Synovial-Osteochondromatosis: Non-mineralized: T1-low/intermediate intensity;T2-high intensity. Mineralized type: low intensity on T1 & T2. Thrombosed Popliteal Aneurysm: Lamellated appearance-high/low signal intensity on T2. Myxoid-Liposarcomas: Inhomogeneous appearance;homogenous with gadolinium. Usually require a biopsy for diagnosis. Conclusion: The cystic lesions in the medial aspect of the popliteal fossa can be misdiagnosed. Our article reiterates the importance of the communicating neck that separates popliteal cysts from other mimics. We have proposed an algorithm to identify these mimics.

Stochastic Design of Enhanced Network Management Architecture and Algorithmic Implementations

The paper is focused on available server management in Internet connected network environments. The local backup servers are hooked up by LAN and replace broken main server immediately and several different types of backup servers are also considered. The remote backup servers are hooked up by VPN (Virtual Private Network) with high-speed optical network. A Virtual Private Network (VPN) is a way to use a public network infrastructure and hooks up long-distance servers within a single network infrastructure. The remote backup servers also replace broken main severs immediately under the different conditions with local backups. When the system performs a mandatory routine maintenance of main and local backup servers, auxiliary servers from other location are being used for backups during idle periods. Analytically tractable results are obtained by using several mathematical techniques and the results are demonstrated in the framework of optimized networked server allocation problems. The operational workflow give the guidelines for the actual implementations.

Melody Generator: A Device for Algorithmic Music Construction

This article describes the development of an application for generating tonal melodies. The goal of the project is to ascertain our current understanding of tonal music by means of algorithmic music generation. The method followed consists of four stages: 1) selection of music-theoretical insights, 2) translation of these insights into a set of principles, 3) conversion of the principles into a computational model having the form of an algorithm for music generation, 4) testing the “music” generated by the algorithm to evaluate the adequacy of the model. As an example, the method is implemented in Melody Generator, an algorithm for generating tonal melodies. The program has a structure suited for generating, displaying, playing and storing melodies, functions which are all accessible via a dedicated interface. The actual generation of melodies, is based in part on constraints imposed by the tonal context, i.e. by meter and key, the settings of which are controlled by means of parameters on the interface. For another part, it is based upon a set of construction principles including the notion of a hierarchical organization, and the idea that melodies consist of a skeleton that may be elaborated in various ways. After these aspects were implemented as specific sub-algorithms, the device produces simple but well-structured tonal melodies.

Underwater four-quadrant dual-beam circumferential scanning laser fuze using nonlinear adaptive backscatter filter based on pauseable SAF-LMS algorithm

The phenomenon of a target echo peak overlapping with the backscattered echo peak significantly undermines the detection range and precision of underwater laser fuzes.To overcome this issue,we propose a four-quadrant dual-beam circumferential scanning laser fuze to distinguish various interference signals and provide more real-time data for the backscatter filtering algorithm.This enhances the algorithm loading capability of the fuze.In order to address the problem of insufficient filtering capacity in existing linear backscatter filtering algorithms,we develop a nonlinear backscattering adaptive filter based on the spline adaptive filter least mean square(SAF-LMS)algorithm.We also designed an algorithm pause module to retain the original trend of the target echo peak,improving the time discrimination accuracy and anti-interference capability of the fuze.Finally,experiments are conducted with varying signal-to-noise ratios of the original underwater target echo signals.The experimental results show that the average signal-to-noise ratio before and after filtering can be improved by more than31 d B,with an increase of up to 76%in extreme detection distance.

Formal Calculation and Invariant-Based Validation Establish Dependable Algorithmic Programs

The paper presents a formal and practical approach to dependable algorithm development.First,starting from a formal specification based on the Eindhoven quantifier notation,a problem is regularly reduced to subproblems with less complexity by using a concise set of calculation rules,the result of which establishes a recurrence-based algorithm.Second,a loop invariant is derived from the problem specification and recurrence,which certifies the transformation from the recurrence-based algorithm to one or more iterative programs.We demonstrate that our approach covers a number of classical algorithm design tactics,develops algorithmic programs together with their proof of correctness,and thus contributes fundamentally to the dependability of computer software.

A comparative study of data-driven battery capacity estimation based on partial charging curves

With its generality and practicality, the combination of partial charging curves and machine learning(ML) for battery capacity estimation has attracted widespread attention. However, a clear classification,fair comparison, and performance rationalization of these methods are lacking, due to the scattered existing studies. To address these issues, we develop 20 capacity estimation methods from three perspectives:charging sequence construction, input forms, and ML models. 22,582 charging curves are generated from 44 cells with different battery chemistry and operating conditions to validate the performance. Through comprehensive and unbiased comparison, the long short-term memory(LSTM) based neural network exhibits the best accuracy and robustness. Across all 6503 tested samples, the mean absolute percentage error(MAPE) for capacity estimation using LSTM is 0.61%, with a maximum error of only 3.94%. Even with the addition of 3 m V voltage noise or the extension of sampling intervals to 60 s, the average MAPE remains below 2%. Furthermore, the charging sequences are provided with physical explanations related to battery degradation to enhance confidence in their application. Recommendations for using other competitive methods are also presented. This work provides valuable insights and guidance for estimating battery capacity based on partial charging curves.

Expert Experience and Data-Driven Based Hybrid Fault Diagnosis for High-SpeedWire Rod Finishing Mills

The reliable operation of high-speed wire rod finishing mills is crucial in the steel production enterprise.As complex system-level equipment,it is difficult for high-speed wire rod finishing mills to realize fault location and real-time monitoring.To solve the above problems,an expert experience and data-driven-based hybrid fault diagnosis method for high-speed wire rod finishing mills is proposed in this paper.First,based on its mechanical structure,time and frequency domain analysis are improved in fault feature extraction.The approach of combining virtual value,peak value with kurtosis value index,is adopted in time domain analysis.Speed adjustment and side frequency analysis are proposed in frequency domain analysis to obtain accurate component characteristic frequency and its corresponding sideband.Then,according to time and frequency domain characteristics,fault location based on expert experience is proposed to get an accurate fault result.Finally,the proposed method is implemented in the equipment intelligent diagnosis system.By taking an equipment fault on site,for example,the effectiveness of the proposed method is illustrated in the system.

MCWOA Scheduler:Modified Chimp-Whale Optimization Algorithm for Task Scheduling in Cloud Computing

Cloud computing provides a diverse and adaptable resource pool over the internet,allowing users to tap into various resources as needed.It has been seen as a robust solution to relevant challenges.A significant delay can hamper the performance of IoT-enabled cloud platforms.However,efficient task scheduling can lower the cloud infrastructure’s energy consumption,thus maximizing the service provider’s revenue by decreasing user job processing times.The proposed Modified Chimp-Whale Optimization Algorithm called Modified Chimp-Whale Optimization Algorithm(MCWOA),combines elements of the Chimp Optimization Algorithm(COA)and the Whale Optimization Algorithm(WOA).To enhance MCWOA’s identification precision,the Sobol sequence is used in the population initialization phase,ensuring an even distribution of the population across the solution space.Moreover,the traditional MCWOA’s local search capabilities are augmented by incorporating the whale optimization algorithm’s bubble-net hunting and random search mechanisms into MCWOA’s position-updating process.This study demonstrates the effectiveness of the proposed approach using a two-story rigid frame and a simply supported beam model.Simulated outcomes reveal that the new method outperforms the original MCWOA,especially in multi-damage detection scenarios.MCWOA excels in avoiding false positives and enhancing computational speed,making it an optimal choice for structural damage detection.The efficiency of the proposed MCWOA is assessed against metrics such as energy usage,computational expense,task duration,and delay.The simulated data indicates that the new MCWOA outpaces other methods across all metrics.The study also references the Whale Optimization Algorithm(WOA),Chimp Algorithm(CA),Ant Lion Optimizer(ALO),Genetic Algorithm(GA)and Grey Wolf Optimizer(GWO).

Algorithmic tangent modulus at finite strains based on multiplicative decomposition

The algorithmic tangent modulus at finite strains in current configuration plays an important role in the nonlinear finite element method. In this work, the exact tensorial forms of the algorithmic tangent modulus at finite strains are derived in the principal space and their corresponding matrix expressions are also presented. The algorithmic tangent modulus consists of two terms. The first term depends on a specific yield surface, while the second term is independent of the specific yield surface. The elastoplastic matrix in the principal space associated with the specific yield surface is derived by the logarithmic strains in terms of the local multiplicative decomposition. The Drucker-Prager yield function of elastoplastic material is used as a numerical example to verify the present algorithmic tangent modulus at finite strains.

Intelligent Evidence-Based Management for Data Collection and Decision-Making Using Algorithmic Randomness and Active Learning

We describe here a comprehensive framework for intelligent information management (IIM) of data collection and decision-making actions for reliable and robust event processing and recognition. This is driven by algorithmic information theory (AIT), in general, and algorithmic randomness and Kolmogorov complexity (KC), in particular. The processing and recognition tasks addressed include data discrimination and multilayer open set data categorization, change detection, data aggregation, clustering and data segmentation, data selection and link analysis, data cleaning and data revision, and prediction and identification of critical states. The unifying theme throughout the paper is that of “compression entails comprehension”, which is realized using the interrelated concepts of randomness vs. regularity and Kolmogorov complexity. The constructive and all encompassing active learning (AL) methodology, which mediates and supports the above theme, is context-driven and takes advantage of statistical learning, in general, and semi-supervised learning and transduction, in particular. Active learning employs explore and exploit actions characteristic of closed-loop control for evidence accumulation in order to revise its prediction models and to reduce uncertainty. The set-based similarity scores, driven by algorithmic randomness and Kolmogorov complexity, employ strangeness / typicality and p-values. We propose the application of the IIM framework to critical states prediction for complex physical systems;in particular, the prediction of cyclone genesis and intensification.