Adaptive Optimal Discrete-Time Output-Feedback Using an Internal Model Principle and Adaptive Dynamic Programming

In order to address the output feedback issue for linear discrete-time systems, this work suggests a brand-new adaptive dynamic programming(ADP) technique based on the internal model principle(IMP). The proposed method, termed as IMP-ADP, does not require complete state feedback-merely the measurement of input and output data. More specifically, based on the IMP, the output control problem can first be converted into a stabilization problem. We then design an observer to reproduce the full state of the system by measuring the inputs and outputs. Moreover, this technique includes both a policy iteration algorithm and a value iteration algorithm to determine the optimal feedback gain without using a dynamic system model. It is important that with this concept one does not need to solve the regulator equation. Finally, this control method was tested on an inverter system of grid-connected LCLs to demonstrate that the proposed method provides the desired performance in terms of both tracking and disturbance rejection.

Optimization Techniques for GPU-Based Parallel Programming Models in High-Performance

This study embarks on a comprehensive examination of optimization techniques within GPU-based parallel programming models,pivotal for advancing high-performance computing(HPC).Emphasizing the transition of GPUs from graphic-centric processors to versatile computing units,it delves into the nuanced optimization of memory access,thread management,algorithmic design,and data structures.These optimizations are critical for exploiting the parallel processing capabilities of GPUs,addressingboth the theoretical frameworks and practical implementations.By integrating advanced strategies such as memory coalescing,dynamic scheduling,and parallel algorithmic transformations,this research aims to significantly elevate computational efficiency and throughput.The findings underscore the potential of optimized GPU programming to revolutionize computational tasks across various domains,highlighting a pathway towards achieving unparalleled processing power and efficiency in HPC environments.The paper not only contributes to the academic discourse on GPU optimization but also provides actionable insights for developers,fostering advancements in computational sciences and technology.

Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems

Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower＇s functions are separable with respect to the follower＇s variables, and the other is that the follower＇s functions are convex if the follower＇s variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader＇s variable x, it is proved that the optimal solution y of the follower＇s mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower＇s programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter λ, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust.

Computation of an Emptiable Minimal Siphon in a Subclass of Petri Nets Using Mixed-Integer Programming

Deadlock resolution strategies based on siphon control are widely investigated.Their computational efficiency largely depends on siphon computation.Mixed-integer programming(MIP)can be utilized for the computation of an emptiable siphon in a Petri net(PN).Based on it,deadlock resolution strategies can be designed without requiring complete siphon enumeration that has exponential complexity.Due to this reason,various MIP methods are proposed for various subclasses of PNs.This work proposes an innovative MIP method to compute an emptiable minimal siphon(EMS)for a subclass of PNs named S^(4)PR.In particular,many particular structural characteristics of EMS in S4 PR are formalized as constraints,which greatly reduces the solution space.Experimental results show that the proposed MIP method has higher computational efficiency.Furthermore,the proposed method allows one to determine the liveness of an ordinary S^(4)PR.

Analysis of an event study using the Fama–French five‑factor model:teaching approaches including spreadsheets and the R programming language

The current financial education framework has an increasing need to introduce tools that facilitate the application of theoretical models to real-world data and contexts.However,only a limited number of free tools are available for this purpose.Given this lack of tools,the present study provides two approaches to facilitate the implementa-tion of an event study.The first approach consists of a set of MS Excel files based on the Fama–French five-factor model,which allows the application of the event study methodology in a semi-automatic manner.The second approach is an open-source R-programmed tool through which results can be obtained in the context of an event study without the need for programming knowledge.This tool widens the calculus possibilities provided by the first approach and offers the option to apply not only the Fama–French five-factor model but also other models that are common in the finan-cial literature.It is a user-friendly tool that enables reproducibility of the analysis and ensures that the calculations are free of manipulation errors.Both approaches are freely available and ready-to-use.

Continuity of the optimal value function and optimal solutions of parametric mixed-integer quadratic programs

To properly describe and solve complex decision problems, research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important. We establish in this paper different Lipschitz-type continuity results about the optimal value function and optimal solutions of mixed-integer parametric quadratic programs with parameters in the linear part of the objective function and in the right-hand sides of the linear constraints. The obtained results extend some existing results for continuous quadratic programs, and, more importantly, lay the foundation for further theoretical study and corresponding algorithm analysis on mixed-integer quadratic programs.

Robust Parameter Identification Method of Adhesion Model for Heavy Haul Trains

A robust parameter identification method based on Kiencke model was proposed to solve the problem of the parameter identification accuracy being affected by the rail environment change and noise interference for heavy-duty trains. Firstly, a Kiencke stick-creep identification model was constructed, and the parameter identification task was transformed into a quadratic programming problem. Secondly, an iterative algorithm was constructed to solve the problem, into which a time-varying forgetting factor was added to track the change of the rail environment, and to solve the uncertainty problem of the wheel-rail environment. The Granger causality test was adopted to detect the interference, and then the weights of the current data were redistributed to solve the problem of noise interference in parameter identification. Finally, simulations were carried out and the results showed that the proposed method could track the change of the track environment in time, reduce the noise interference in the identification process, and effectively identify the adhesion performance parameters.

Rapid Prototype Development Approach for Genetic Programming

Genetic Programming (GP) is an important approach to deal with complex problem analysis and modeling, and has been applied in a wide range of areas. The development of GP involves various aspects, including design of genetic operators, evolutionary controls and implementations of heuristic strategy, evaluations and other mechanisms. When designing genetic operators, it is necessary to consider the possible limitations of encoding methods of individuals. And when selecting evolutionary control strategies, it is also necessary to balance search efficiency and diversity based on representation characteristics as well as the problem itself. More importantly, all of these matters, among others, have to be implemented through tedious coding work. Therefore, GP development is both complex and time-consuming. To overcome some of these difficulties that hinder the enhancement of GP development efficiency, we explore the feasibility of mutual assistance among GP variants, and then propose a rapid GP prototyping development method based on πGrammatical Evolution (πGE). It is demonstrated through regression analysis experiments that not only is this method beneficial for the GP developers to get rid of some tedious implementations, but also enables them to concentrate on the essence of the referred problem, such as individual representation, decoding means and evaluation. Additionally, it provides new insights into the roles of individual delineations in phenotypes and semantic research of individuals.

An Approach to Detect Structural Development Defects in Object-Oriented Programs

Structural development defects essentially refer to code structure that violates object-oriented design principles. They make program maintenance challenging and deteriorate software quality over time. Various detection approaches, ranging from traditional heuristic algorithms to machine learning methods, are used to identify these defects. Ensemble learning methods have strengthened the detection of these defects. However, existing approaches do not simultaneously exploit the capabilities of extracting relevant features from pre-trained models and the performance of neural networks for the classification task. Therefore, our goal has been to design a model that combines a pre-trained model to extract relevant features from code excerpts through transfer learning and a bagging method with a base estimator, a dense neural network, for defect classification. To achieve this, we composed multiple samples of the same size with replacements from the imbalanced dataset MLCQ1. For all the samples, we used the CodeT5-small variant to extract features and trained a bagging method with the neural network Roberta Classification Head to classify defects based on these features. We then compared this model to RandomForest, one of the ensemble methods that yields good results. Our experiments showed that the number of base estimators to use for bagging depends on the defect to be detected. Next, we observed that it was not necessary to use a data balancing technique with our model when the imbalance rate was 23%. Finally, for blob detection, RandomForest had a median MCC value of 0.36 compared to 0.12 for our method. However, our method was predominant in Long Method detection with a median MCC value of 0.53 compared to 0.42 for RandomForest. These results suggest that the performance of ensemble methods in detecting structural development defects is dependent on specific defects.

New partial cooperation model for bilevel programming problems

Partial cooperation models are studied for many years to solve the bilevel programming problems where the follower’s optimal reaction is not unique. However, in these existed models, the follower’s cooperation level does not depend on the leader’s decision. A new model is proposed to solve this deficiency. It is proved the feasibility of the new model when the reaction set of the lower level is lower semicontinuous. And the numerical results show that the new model has optimal solutions when the reaction set of the lower level is discrete, lower semi-continuous and non-lower semi-continuous.

ARTIFICIAL NEURAL NETWORKS-MODELING, PROGRAMMING AND APPLICATION IN MATERIAL HOT WORKING

The developments of modern mathematics and computer science make artificial neural networks become most useful tools in wide range of fields. Modeling methods of artificial neural networks are described in this paper. The programming technique by using Matlab neural networks toolbox is discussed. The application in Material Hot Working of neural networks is also introduced.

Application of numerical modeling and genetic programming to estimate rock mass modulus of deformation

Estimation of the rock mass modulus of deformation(Em)is one of the most important design parameters in designing many structures in and on rock.This parameter can be obtained by in situ tests,empirical relations between deformation modulus and rock mass classifcation,and estimating from laboratory tests results.In this paper,a back analysis calculation is performed to present an equation for estimation of the rock mass modulus of deformation using genetic programming(GP)and numerical modeling.A database of 40,960 datasets,including vertical stress(rz),horizontal to vertical stresses ratio(k),Poisson’s ratio(m),radius of circular tunnel(r)and wall displacement of circular tunnel on the horizontal diameter(d)for input parameters and modulus of deformation for output,was established.The selected parameters are easy to determine and rock mass modulus of deformation can be obtained from instrumentation data of any size circular galleries.The resulting RMSE of 0.86 and correlation coeffcient of97%of the proposed equation demonstrated the capability of the computer program(CP)generated by GP.

A simulation-based two-stage interval-stochastic programming model for water resources management in Kaidu-Konqi watershed,China

This study presented a simulation-based two-stage interval-stochastic programming （STIP） model to support water resources management in the Kaidu-Konqi watershed in Northwest China. The modeling system coupled a distributed hydrological model with an interval two-stage stochastic programing （ITSP）. The distributed hydrological model was used for establishing a rainfall-runoff forecast system, while random parameters were pro- vided by the statistical analysis of simulation outcomes water resources management planning in Kaidu-Konqi The developed STIP model was applied to a real case of watershed, where three scenarios with different water re- sources management policies were analyzed. The results indicated that water shortage mainly occurred in agri- culture, ecology and forestry sectors. In comparison, the water demand from municipality, industry and stock- breeding sectors can be satisfied due to their lower consumptions and higher economic values. Different policies for ecological water allocation can result in varied system benefits, and can help to identify desired water allocation plans with a maximum economic benefit and a minimum risk of system disruption under uncertainty.

Penalty model for delay of bidding section construction period in South-to-North Water Diversion Eastern Route Project from perspective of programs

According to the multi-project and program management theory, this paper analyzes the program generation principle and establishes a program based on progress goals. On the basis of the present situation of calculation of penalty for delay of the bidding section construction period with the critical path method, we studied the effects of contractor-induced delay of the bidding section construction period in detail, including the effects on the construction period of the bidding section itself, the earliest start times of the next bidding section and other subsequent bidding sections, and the construction period of the program, and then constructed a penalty model for delay of the bidding section construction period from the perspective of programs. Using the penalty model, we conducted a practical analysis of penalty for delay of the construction period of the Baoying station program in the South-to-North Water Diversion Project. The model can help determine the amount of penalty for delay of the construction period in bidding sections scientifically and reasonably,

Nonlinear Model-Based Process Operation under UncertaintyUsing Exact Parametric Programming

In the present work, two new, （multi-）parametric programming （mp-P）-inspired algorithms for the solutionof mixed-integer nonlinear programming （MINLP） problems are developed, with their main focus being onprocess synthesis problems. The algorithms are developed for the special case in which the nonlinearitiesarise because of logarithmic terms, with the first one being developed for the deterministic case, and thesecond for the parametric case （p-MINLP）. The key idea is to formulate and solve the square system of thefirst-order Karush-Kuhn-Tucker （KKT） conditions in an analytical way, by treating the binary variables and/or uncertain parameters as symbolic parameters. To this effect, symbolic manipulation and solution tech-niques are employed. In order to demonstrate the applicability and validity of the proposed algorithms, twoprocess synthesis case studies are examined. The corresponding solutions are then validated using state-of-the-art numerical MINLP solvers. For p-MINLP, the solution is given by an optimal solution as an explicitfunction of the uncertain parameters.

A Quadratic Programming Model for Blast Scheduling

A quadratic programming model is established to choose the blocks to be blasted in a given period. The length of this period depends on the production planning requirements. During the given period, the blocks' parameters are available from the geological database of the mine. The objective is to minimize the deviation of the average ore grade of blasted blocks from the standard ore grade required by the mill. Transportation ability constraint. production quantity demand constraint. minimum safety bench constraint. block size constraint and block, bench precedence constraints are considered in forming the programming model. This model has more practical objective function and reasonable constraints compared with the existing model for this kind of problems.

Applying the Socio-Ecological Model to barriers to implementation of ACL injury prevention programs: A systematic review

Background: Preventing anterior cruciate ligament(ACL) injuries is important to avoid long-term adverse health consequences. Identifying barriers to implementation of these prevention programs is crucial to reducing the incidence of these injuries. Our purpose was to identify barriers of implementation for ACL injury prevention programs and suggest mechanisms for reducing the barriers through application of a SocioEcological Model(SEM).Methods: Studies investigating ACL prevention program effectiveness were searched in Medline via PubMed and the Cochrane Library, and a subsequent review of the references of the identified articles, yielded 15 articles total. Inclusion criteria encompassed prospective controlled trials, published in English, with ACL injuries as the primary outcome. Studies were independently appraised by 2 reviewers for methodological quality using the PEDro scale. Barriers to implementation were identified when reported in at least 2 separate studies. A SEM was used to suggest ways to reduce the identified barriers.Results: Five barriers were identified: motivation, time requirements, skill requirements for program facilitators, compliance, and cost. The SEM suggested ways to minimize the barriers at all levels of the model from the individual through policy levels.Conclusion: Identification of barriers to program implementation and suggesting how to reduce them through the SEM is a critical first step toward enabling ACL prevention programs to be more effective and ultimately reducing the incidence of these injuries.

A dynamic food-chain model and program for predicting the consequences of nuclear accident

A dynamic food chain model and program, DYFOM 95, for predicting the radiological consequences of nuclear accident has been developed, which is not only suitable to the West food chain but also to Chinese food chain. The following processes, caused by accident release which will make an impact on radionuclide concentration in the edible parts of vegetable were considered: dry and wet deposition interception and initial retention, translocation, percolation, root uptake and tillage. Activity intake rate of animals, effects of processing and activity intake of human through ingestion pathway ware also considered in calculations. The effects of leaf area index LAI of vegetable were considered in dry deposition model. A method for calculating the contribution of rain with different period and different intensity to total wet deposition was established. The program contains 1 main code and 5 sub codes to calculate dry and wet deposition on surface of vegetable and soil, translocation of nuclides in vegetable, nuclide concentration in the edible parts of vegetable and in animal products and activity intake of human and so on.

HEURISTIC MODELING FOR A DYNAMIC AND GOAL PROGRAMMING IN PRODUCTION PLANNING OF CONTINUOUS MANUFACTURING SYSTEMS

At the first sight it seems that advanced operation research is not used enough in continuous production systems as comparison with mass production, batch production and job shop systems, but really in a comprehensive evaluation the advanced operation research techniques can be used in continuous production systems in developing countries very widely, because of initial inadequate plant layout, stage by stage development of production lines, the purchase of second hand machineries from various countries, plurality of customers. A case of production system planning is proposed for a chemical company in which the above mentioned conditions are almost presented. The goals and constraints in this issue are as follows： （1） Minimizing deviation of customer＇s requirements. （2） Maximizing the profit. （3） Minimizing the frequencies of changes in formula production. （4） Minimizing the inventory of final products. （5） Balancing the production sections with regard to rate in production. （6） Limitation in inventory of raw material. The present situation is in such a way that various techniques such as goal programming, linear programming and dynamic programming can be used. But dynamic production programming issues are divided into two categories, at first one with limitation in production capacity and another with unlimited production capacity. For the first category, a systematic and acceptable solution has not been presented yet. Therefore an innovative method is used to convert the dynamic situation to a zero- one model. At last this issue is changed to a goal programming model with non-linear limitations with the use of GRG algorithm and that＇s how it is solved.