Dear Editor,Aiming at the consensus tracking problem of a class of unknown heterogeneous nonlinear multiagent systems(MASs)with input constraints,a novel data-driven iterative learning consensus control(ILCC)protocol ...Dear Editor,Aiming at the consensus tracking problem of a class of unknown heterogeneous nonlinear multiagent systems(MASs)with input constraints,a novel data-driven iterative learning consensus control(ILCC)protocol based on zeroing neural networks(ZNNs)is proposed.First,a dynamic linearization data model(DLDM)is acquired via dynamic linearization technology(DLT).展开更多
The concept of the liquid Li17Pb83 and Helium gas dual-cooled Fuel Breeding Blanket (FBB) for the Fusion-Driven sub-critical System (FDS) is presented and analyzed. Taking self-sustaining tritium (TBR >1.05) and an...The concept of the liquid Li17Pb83 and Helium gas dual-cooled Fuel Breeding Blanket (FBB) for the Fusion-Driven sub-critical System (FDS) is presented and analyzed. Taking self-sustaining tritium (TBR >1.05) and annual output of 100 kg or more fissile 239Pu (FBR > 0.238) as objective parameters, and based on the three-dimensional Monte Carlo neutron-photon transport code MCNP/4A, a neutronics-optimizated calculation of different cases was carried out and the concept is proved feasible. In addition, the total breeding ratio ( BR = TBR + FBR ) is listed corresponding to different cases.展开更多
A numerical algorithm using a bilinear or linear finite element and semi-implicit three-step method is presented for the analysis of incompressible viscous fluid problems. The streamline upwind/Petrov-Galerkin (SUPG) ...A numerical algorithm using a bilinear or linear finite element and semi-implicit three-step method is presented for the analysis of incompressible viscous fluid problems. The streamline upwind/Petrov-Galerkin (SUPG) stabilization scheme is used for the formulation of the Navier-Stokes equations. For the spatial discretization, the convection term is treated explicitly, while the viscous term is treated implicitly, and for the temporal discretization, a three-step method is employed. The present method is applied to simulate the lid driven cavity problems with different geometries at low and high Reynolds numbers. The results compared with other numerical experiments are found to be feasible and satisfactory.展开更多
In this paper, a branch-and-bound method for solving multi-dimensional quadratic 0-1 knapsack problems was studied. The method was based on the Lagrangian relaxation and the surrogate constraint technique for finding ...In this paper, a branch-and-bound method for solving multi-dimensional quadratic 0-1 knapsack problems was studied. The method was based on the Lagrangian relaxation and the surrogate constraint technique for finding feasible solutions. The Lagrangian relaxations were solved with the maximum-flow algorithm and the Lagrangian bounds was determined with the outer approximation method. Computational results show the efficiency of the proposed method for multi-dimensional quadratic 0-1 knapsack problems.展开更多
0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. The...0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. Then, the 0-1 optimization problems are solved by a neural network model with transient chaotic dynamics (TCNN). Numerical simulations of two typical 0-1 optimization problems show that TCNN can overcome HNN's main drawbacks that it suffers from the local minimum and can search for the global optimal solutions in to solveing 0-1 optimization problems.展开更多
The key problems of cold power spinning of Ti-15-3 alloy are studied. Reasonable billet preparation methods are presented to improve crystal structure and avoid crack of billet. Influences of original wall thickness,...The key problems of cold power spinning of Ti-15-3 alloy are studied. Reasonable billet preparation methods are presented to improve crystal structure and avoid crack of billet. Influences of original wall thickness, reduction rate and feed rate on expanding in diameter are analyzed and some methods to prevent expanding in diameter are given.展开更多
Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet ...Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet or Robin boundary conditions are considered,and the generalized Jacobi spectral schemes are proposed. For the diagonalization of discrete systems,the Jacobi-Sobolev orthogonal basis functions are constructed,which allow the exact solutions and the approximate solutions to be represented in the forms of infinite and truncated Jacobi series. Error estimates are obtained and numerical results are provided to illustrate the effectiveness and the spectral accuracy.展开更多
This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Auto...This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Automata （MDFA） is defined. MDFA allows the representation of the feasible solutions space of combinatorial problems. Second, it is defined and implemented a metaheuritic based on MDFA theory. It is named Metaheuristic of Deterministic Swapping （MODS）. MODS is a local search strategy that works using a MDFA. Due to this, MODS never take into account unfeasible solutions. Hence, it is not necessary to verify the problem constraints for a new solution found. Lastly, MODS is tested using well know instances of the Bi-Objective Traveling Salesman Problem （TSP） from TSPLIB. Its results were compared with eight Ant Colony inspired algorithms and two Genetic algorithms taken from the specialized literature. The comparison was made using metrics such as Spacing, Generational Distance, Inverse Generational Distance and No-Dominated Generation Vectors. In every case, the MODS results on the metrics were always better and in some of those cases, the superiority was 100%.展开更多
In this paper, we investigate the existence and uniqueness of solutions for a new fourth-order differential equation boundary value problem：{u（4）（t） = f（t, u（t））-b, 0 〈 t 〈 1,u（0） = u′（0） = u′（1） = ...In this paper, we investigate the existence and uniqueness of solutions for a new fourth-order differential equation boundary value problem：{u（4）（t） = f（t, u（t））-b, 0 〈 t 〈 1,u（0） = u′（0） = u′（1） = u（3）（1） = 0,where f ∈ C（[0,1] ×（-∞,＋∞）,（-∞, ＋∞））,b ≥ 0 is a constant. The novelty of this paper is that the boundary value problem is a new type and the method is a new fixed point theorem ofφ-（h,e）-concave operators.展开更多
Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed...Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.展开更多
基金supported by the National Nature Science Foundation of China(U21A20166)the Science and Technology Development Foundation of Jilin Province(20230508095RC)+2 种基金the Major Science and Technology Projects of Jilin Province and Changchun City(20220301033GX)the Development and Reform Commission Foundation of Jilin Province(2023C034-3)the Interdisciplinary Integration and Innovation Project of JLU(JLUXKJC2020202).
文摘Dear Editor,Aiming at the consensus tracking problem of a class of unknown heterogeneous nonlinear multiagent systems(MASs)with input constraints,a novel data-driven iterative learning consensus control(ILCC)protocol based on zeroing neural networks(ZNNs)is proposed.First,a dynamic linearization data model(DLDM)is acquired via dynamic linearization technology(DLT).
基金Supported by State Key Program of National Natural Science Foundation of China （60834001） and National Natural Science Foundation of China （60774022）.Acknowledgement Authors would like to thank NSFC organizers and participants who shared their ideas and works with us during the NSFC workshop on data-based control, decision making, scheduling, and fault diagnosis. In particular, authors would like to thank Chai Tian-You, Sun You-Xian, Wang Hong, Yan Hong-Sheng, and Gao Fu-Rong for discussing the concept on design model shown in Fig. 12, the concept on temporal multi-scale shown in Fig. 8, the concept on fault diagnosis shown in Fig. 14, the concept on dynamic scheduling shown in Fig. 15, and the concept on interval model shown in Fig. 16, respectively.
基金This work was supported by the Chinese Academy of Sciences and the National Natural Science Foundation of China No.10175068.
文摘The concept of the liquid Li17Pb83 and Helium gas dual-cooled Fuel Breeding Blanket (FBB) for the Fusion-Driven sub-critical System (FDS) is presented and analyzed. Taking self-sustaining tritium (TBR >1.05) and annual output of 100 kg or more fissile 239Pu (FBR > 0.238) as objective parameters, and based on the three-dimensional Monte Carlo neutron-photon transport code MCNP/4A, a neutronics-optimizated calculation of different cases was carried out and the concept is proved feasible. In addition, the total breeding ratio ( BR = TBR + FBR ) is listed corresponding to different cases.
基金Project supported by the National Natural Science Foundation of China (No.51078230)the Research Fund for the Doctoral Program of Higher Education of China (No.200802480056)the Key Project of Fund of Science and Technology Development of Shanghai (No.10JC1407900),China
文摘A numerical algorithm using a bilinear or linear finite element and semi-implicit three-step method is presented for the analysis of incompressible viscous fluid problems. The streamline upwind/Petrov-Galerkin (SUPG) stabilization scheme is used for the formulation of the Navier-Stokes equations. For the spatial discretization, the convection term is treated explicitly, while the viscous term is treated implicitly, and for the temporal discretization, a three-step method is employed. The present method is applied to simulate the lid driven cavity problems with different geometries at low and high Reynolds numbers. The results compared with other numerical experiments are found to be feasible and satisfactory.
基金Project supported by the National Natural Science Foundation of China （Grant No.10571116）
文摘In this paper, a branch-and-bound method for solving multi-dimensional quadratic 0-1 knapsack problems was studied. The method was based on the Lagrangian relaxation and the surrogate constraint technique for finding feasible solutions. The Lagrangian relaxations were solved with the maximum-flow algorithm and the Lagrangian bounds was determined with the outer approximation method. Computational results show the efficiency of the proposed method for multi-dimensional quadratic 0-1 knapsack problems.
基金This project was supported by the National Natural Science Foundation of China (79970042).
文摘0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. Then, the 0-1 optimization problems are solved by a neural network model with transient chaotic dynamics (TCNN). Numerical simulations of two typical 0-1 optimization problems show that TCNN can overcome HNN's main drawbacks that it suffers from the local minimum and can search for the global optimal solutions in to solveing 0-1 optimization problems.
文摘The key problems of cold power spinning of Ti-15-3 alloy are studied. Reasonable billet preparation methods are presented to improve crystal structure and avoid crack of billet. Influences of original wall thickness, reduction rate and feed rate on expanding in diameter are analyzed and some methods to prevent expanding in diameter are given.
基金the National Natural Science Foundation of China (Nos.11571238,11601332,91130014,11471312 and 91430216).
文摘Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet or Robin boundary conditions are considered,and the generalized Jacobi spectral schemes are proposed. For the diagonalization of discrete systems,the Jacobi-Sobolev orthogonal basis functions are constructed,which allow the exact solutions and the approximate solutions to be represented in the forms of infinite and truncated Jacobi series. Error estimates are obtained and numerical results are provided to illustrate the effectiveness and the spectral accuracy.
文摘This paper states a new metaheuristic based on Deterministic Finite Automata （DFA） for the multi - objective optimization of combinatorial problems. First, a new DFA named Multi - Objective Deterministic Finite Automata （MDFA） is defined. MDFA allows the representation of the feasible solutions space of combinatorial problems. Second, it is defined and implemented a metaheuritic based on MDFA theory. It is named Metaheuristic of Deterministic Swapping （MODS）. MODS is a local search strategy that works using a MDFA. Due to this, MODS never take into account unfeasible solutions. Hence, it is not necessary to verify the problem constraints for a new solution found. Lastly, MODS is tested using well know instances of the Bi-Objective Traveling Salesman Problem （TSP） from TSPLIB. Its results were compared with eight Ant Colony inspired algorithms and two Genetic algorithms taken from the specialized literature. The comparison was made using metrics such as Spacing, Generational Distance, Inverse Generational Distance and No-Dominated Generation Vectors. In every case, the MODS results on the metrics were always better and in some of those cases, the superiority was 100%.
基金Supported by the Shanxi Scholarship Council of China(Grant No.2016-009)the Natural Science Foundation of Shanxi Province(Grant No.201701D121004)
文摘In this paper, we investigate the existence and uniqueness of solutions for a new fourth-order differential equation boundary value problem：{u（4）（t） = f（t, u（t））-b, 0 〈 t 〈 1,u（0） = u′（0） = u′（1） = u（3）（1） = 0,where f ∈ C（[0,1] ×（-∞,＋∞）,（-∞, ＋∞））,b ≥ 0 is a constant. The novelty of this paper is that the boundary value problem is a new type and the method is a new fixed point theorem ofφ-（h,e）-concave operators.
文摘Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.
