Mathematical physics equations are often utilized to describe physical phenomena in various fields of science and engineering.One such equation is the Fourier equation,which is a commonly used and effective method for...Mathematical physics equations are often utilized to describe physical phenomena in various fields of science and engineering.One such equation is the Fourier equation,which is a commonly used and effective method for evaluating the effectiveness of temperature control measures for mass concrete.One important measure for temperature control in mass concrete is the use of cooling water pipes.However,the mismatch of grids between large-scale concrete models and small-scale cooling pipe models can result in a significant waste of calculation time when using the finite element method.Moreover,the temperature of the water in the cooling pipe needs to be iteratively calculated during the thermal transfer process.The substructure method can effectively solve this problem,and it has been validated by scholars.The Abaqus/Python secondary development technology provides engineers with enough flexibility to combine the substructure method with an iteration algorithm,which enables the creation of a parametric modeling calculation for cooling water pipes.This paper proposes such a method,which involves iterating the water pipe boundary and establishing the water pipe unit substructure to numerically simulate the concrete temperature field that contains a cooling water pipe.To verify the feasibility and accuracy of the proposed method,two classic numerical examples were analyzed.The results showed that this method has good applicability in cooling pipe calculations.When the value of the iteration parameterαis 0.4,the boundary temperature of the cooling water pipes can meet the accuracy requirements after 4∼5 iterations,effectively improving the computational efficiency.Overall,this approach provides a useful tool for engineers to analyze the temperature control measures accurately and efficiently for mass concrete,such as cooling water pipes,using Abaqus/Python secondary development.展开更多
This paper studies the policy iteration algorithm(PIA)for zero-sum stochastic differential games with the basic long-run average criterion,as well as with its more selective version,the so-called bias criterion.The sy...This paper studies the policy iteration algorithm(PIA)for zero-sum stochastic differential games with the basic long-run average criterion,as well as with its more selective version,the so-called bias criterion.The system is assumed to be a nondegenerate diffusion.We use Lyapunov-like stability conditions that ensure the existence and boundedness of the solution to certain Poisson equation.We also ensure the convergence of a sequence of such solutions,of the corresponding sequence of policies,and,ultimately,of the PIA.展开更多
Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the...Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the rotor vibration in AMBs is to adopt a notch filter or adaptive filter in the AMB controller. However, these methods cannot obtain the precise amplitude and phase of the compensation current. Thus, they are not so effective in terms of suppressing the vibrations of the fundamental and other harmonic orders over the whole speed range. To improve the vibration suppression performance of AMBs,an adaptive filter based on Least Mean Square(LMS) is applied to extract the vibration signals from the rotor displacement signal. An Iterative Search Algorithm(ISA) is proposed in this paper to obtain the corresponding relationship between the compensation current and vibration signals. The ISA is responsible for searching the compensating amplitude and shifting phase online for the LMS filter, enabling the AMB controller to generate the corresponding compensation force for vibration suppression. The results of ISA are recorded to suppress vibration using the Look-Up Table(LUT) in variable speed range. Comprehensive simulations and experimental validations are carried out in fixed and variable speed range, and the results demonstrate that by employing the ISA, vibrations of the fundamental and other harmonic orders are suppressed effectively.展开更多
Safety patrol inspection in chemical industrial parks is a complex multi-objective task with multiple degrees of freedom.Traditional pointer instruments with advantages like high reliability and strong adaptability to...Safety patrol inspection in chemical industrial parks is a complex multi-objective task with multiple degrees of freedom.Traditional pointer instruments with advantages like high reliability and strong adaptability to harsh environment,are widely applied in such parks.However,they rely on manual readings which have problems like heavy patrol workload,high labor cost,high false positives/negatives and poor timeliness.To address the above problems,this study proposes a path planning method for robot patrol in chemical industrial parks,where a path optimization model based on improved iterated local search and random variable neighborhood descent(ILS-RVND)algorithm is established by integrating the actual requirements of patrol tasks in chemical industrial parks.Further,the effectiveness of the model and algorithm is verified by taking real park data as an example.The results show that compared with GA and ILS-RVND,the improved algorithm reduces quantification cost by about 24%and saves patrol time by about 36%.Apart from shortening the patrol time of robots,optimizing their patrol path and reducing their maintenance loss,the proposed algorithm also avoids the untimely patrol of robots and enhances the safety factor of equipment.展开更多
An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for...An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for the generalized set-valued strongly nonlinear mixed variational-like inequalities are proved, a novel and innovative three-step iterative algorithm to compute approximate solution is constructed, and the existence of the solution of the generalized set-valued strongly nonlinear mixed variational-like inequality is shown using the auxiliary principle iterative sequences generated by the algorithm technique. The convergence of three-step is also proved.展开更多
A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the sol...A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the solution process of the present method is simplified, and the computation efficiency as well as the reliability for obtaining all solutions is also improved. By application of the method to the mechanisms problems, the results are satisfactory.展开更多
In this paper, an improved gradient iterative (GI) algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared wi...In this paper, an improved gradient iterative (GI) algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.展开更多
A new class of generalized mixed implicit quasi-equilibrium problems (GMIQEP) with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems...A new class of generalized mixed implicit quasi-equilibrium problems (GMIQEP) with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems and generalized mixed implicit quasi-variational inequality problems as many special cases. By employing the auxiliary principle technique, some predictor-corrector iterative algorithms for solving the GMIQEP are suggested and analyzed. The convergence of the suggested algorithm only requires the continuity and the partially relaxed implicit strong monotonicity of the mappings展开更多
In this paper, on the basis of von Karman large deflection equations and its double trigonometric series solution, we present a simple, fast and effective iteration algorithm for solving simply-supported rectangular p...In this paper, on the basis of von Karman large deflection equations and its double trigonometric series solution, we present a simple, fast and effective iteration algorithm for solving simply-supported rectangular plate subjected to biaxial compression.展开更多
It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used suc...It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.展开更多
In this paper we use the auxiliary principle technique to suggest and analyze novel and innovative iterative algorithms for a class of nonlinear variational inequalities. Several special cases, which can be obtained f...In this paper we use the auxiliary principle technique to suggest and analyze novel and innovative iterative algorithms for a class of nonlinear variational inequalities. Several special cases, which can be obtained from our main results, are also discussed.展开更多
We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization(ML-EM)algorithm.In this study,we extend these algorithms to Bayesian algorithms...We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization(ML-EM)algorithm.In this study,we extend these algorithms to Bayesian algorithms.The family of emission-EM-lookalike algorithms utilizes a multiplicative update scheme.The extension of these algorithms to Bayesian algorithms is achieved by introducing a new simple factor,which contains the Bayesian information.One of the extended algorithms can be applied to emission tomography and another to transmission tomography.Computer simulations are performed and compared with the corresponding un-extended algorithms.The total-variation norm is employed as the Bayesian constraint in the computer simulations.The newly developed algorithms demonstrate a stable performance.A simple Bayesian algorithm can be derived for any noise variance function.The proposed algorithms have properties such as multiplicative updating,non-negativity,faster convergence rates for bright objects,and ease of implementation.Our algorithms are inspired by Green’s one-steplate algorithm.If written in additive-update form,Green’s algorithm has a step size determined by the future image value,which is an undesirable feature that our algorithms do not have.展开更多
A large amount of waste liquids containing methanol/acetone/water mixtures are produced in the synthesis of methyl methacrylate(MMA).Under the advocacy of green chemical industry,it is urgent to develop an efficient,e...A large amount of waste liquids containing methanol/acetone/water mixtures are produced in the synthesis of methyl methacrylate(MMA).Under the advocacy of green chemical industry,it is urgent to develop an efficient,economic and energy-saving mixture separation process.Through thermodynamic azeotropic behavior and pressure sensitivity analysis,pressure-swing distillation was determined and the optimal separation pressure of each column in the process was obtained.Due to the composition of waste liquids produced were quite different in MMA production,the pressure-swing distillation separation process was designed to fully achieve the accurate waste liquids treatment.Taking the total annual cost(TAC)as the target,the sequential iteration method was used to optimize the process,and the impact of composition on economy was compared.In order to further realize the energy-saving of the separation process,the pervaporation membrane module was introduced to pretreat the waste liquid in the pressure-swing distillation.The results showed that the TAC of the coupling process was 46% higher than that of the pressure-swing distillation process,and the thermodynamic efficiency was 30% higher.This study provides waste liquid treatment technology for enterprises and analyzes its economic and energy efficiency,which has reference significance for the development of coupled separation technology.展开更多
Discrete Tomography(DT)is a technology that uses image projection to reconstruct images.Its reconstruction problem,especially the binary image(0–1matrix)has attracted strong attention.In this study,a fixed point iter...Discrete Tomography(DT)is a technology that uses image projection to reconstruct images.Its reconstruction problem,especially the binary image(0–1matrix)has attracted strong attention.In this study,a fixed point iterative method of integer programming based on intelligent optimization is proposed to optimize the reconstructedmodel.The solution process can be divided into two procedures.First,the DT problem is reformulated into a polyhedron judgment problembased on lattice basis reduction.Second,the fixed-point iterativemethod of Dang and Ye is used to judge whether an integer point exists in the polyhedron of the previous program.All the programs involved in this study are written in MATLAB.The final experimental data show that this method is obviously better than the branch and bound method in terms of computational efficiency,especially in the case of high dimension.The branch and bound method requires more branch operations and takes a long time.It also needs to store a large number of leaf node boundaries and the corresponding consumptionmatrix,which occupies a largememory space.展开更多
Airborne laser scanning(ALS)and terrestrial laser scanning(TLS)has attracted attention due to their forest parameter investigation and research applications.ALS is limited to obtaining fi ne structure information belo...Airborne laser scanning(ALS)and terrestrial laser scanning(TLS)has attracted attention due to their forest parameter investigation and research applications.ALS is limited to obtaining fi ne structure information below the forest canopy due to the occlusion of trees in natural forests.In contrast,TLS is unable to gather fi ne structure information about the upper canopy.To address the problem of incomplete acquisition of natural forest point cloud data by ALS and TLS on a single platform,this study proposes data registration without control points.The ALS and TLS original data were cropped according to sample plot size,and the ALS point cloud data was converted into relative coordinates with the center of the cropped data as the origin.The same feature point pairs of the ALS and TLS point cloud data were then selected to register the point cloud data.The initial registered point cloud data was fi nely and optimally registered via the iterative closest point(ICP)algorithm.The results show that the proposed method achieved highprecision registration of ALS and TLS point cloud data from two natural forest plots of Pinus yunnanensis Franch.and Picea asperata Mast.which included diff erent species and environments.An average registration accuracy of 0.06 m and 0.09 m were obtained for P.yunnanensis and P.asperata,respectively.展开更多
In this paper, we use resolvent operator technology to construct a viscosity approximate algorithm to approximate a common solution of split variational inclusion problem and split fixed point problem for an averaged ...In this paper, we use resolvent operator technology to construct a viscosity approximate algorithm to approximate a common solution of split variational inclusion problem and split fixed point problem for an averaged mapping in real Hilbert spaces. Further, we prove that the sequences generated by the proposed iterative method converge strongly to a common solution of split variational inclusion problem and split fixed point problem for averaged mappings which is also the unique solution of the variational inequality problem. The results presented here improve and extend the corresponding results in this area.展开更多
The one-bit compressed sensing problem is of fundamental importance in many areas,such as wireless communication,statistics,and so on.However,the optimization of one-bit problem coustrained on the unit sphere lacks an...The one-bit compressed sensing problem is of fundamental importance in many areas,such as wireless communication,statistics,and so on.However,the optimization of one-bit problem coustrained on the unit sphere lacks an algorithm with rigorous mathematical proof of convergence and validity.In this paper,an iteration algorithm is established based on difference-of-convex algorithm for the one-bit compressed sensing problem constrained on the unit sphere,with iterating formula■,where C is the convex cone generated by the one-bit measurements andη_(1)>η_(2)>1/2.The new algorithm is proved to converge as long as the initial point is on the unit sphere and accords with the measurements,and the convergence to the global minimum point of the l_(1)norm is discussed.展开更多
To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform (STFT) is brought forward. ...To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform (STFT) is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.展开更多
Group scheduling problems have attracted much attention owing to their many practical applications.This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-de...Group scheduling problems have attracted much attention owing to their many practical applications.This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-dependent setup time,release time,and due time.It is originated from an important industrial process,i.e.,wire rod and bar rolling process in steel production systems.Two objective functions,i.e.,the number of late jobs and total setup time,are minimized.A mixed integer linear program is established to describe the problem.To obtain its Pareto solutions,we present a memetic algorithm that integrates a population-based nondominated sorting genetic algorithm II and two single-solution-based improvement methods,i.e.,an insertion-based local search and an iterated greedy algorithm.The computational results on extensive industrial data with the scale of a one-week schedule show that the proposed algorithm has great performance in solving the concerned problem and outperforms its peers.Its high accuracy and efficiency imply its great potential to be applied to solve industrial-size group scheduling problems.展开更多
文摘Mathematical physics equations are often utilized to describe physical phenomena in various fields of science and engineering.One such equation is the Fourier equation,which is a commonly used and effective method for evaluating the effectiveness of temperature control measures for mass concrete.One important measure for temperature control in mass concrete is the use of cooling water pipes.However,the mismatch of grids between large-scale concrete models and small-scale cooling pipe models can result in a significant waste of calculation time when using the finite element method.Moreover,the temperature of the water in the cooling pipe needs to be iteratively calculated during the thermal transfer process.The substructure method can effectively solve this problem,and it has been validated by scholars.The Abaqus/Python secondary development technology provides engineers with enough flexibility to combine the substructure method with an iteration algorithm,which enables the creation of a parametric modeling calculation for cooling water pipes.This paper proposes such a method,which involves iterating the water pipe boundary and establishing the water pipe unit substructure to numerically simulate the concrete temperature field that contains a cooling water pipe.To verify the feasibility and accuracy of the proposed method,two classic numerical examples were analyzed.The results showed that this method has good applicability in cooling pipe calculations.When the value of the iteration parameterαis 0.4,the boundary temperature of the cooling water pipes can meet the accuracy requirements after 4∼5 iterations,effectively improving the computational efficiency.Overall,this approach provides a useful tool for engineers to analyze the temperature control measures accurately and efficiently for mass concrete,such as cooling water pipes,using Abaqus/Python secondary development.
文摘This paper studies the policy iteration algorithm(PIA)for zero-sum stochastic differential games with the basic long-run average criterion,as well as with its more selective version,the so-called bias criterion.The system is assumed to be a nondegenerate diffusion.We use Lyapunov-like stability conditions that ensure the existence and boundedness of the solution to certain Poisson equation.We also ensure the convergence of a sequence of such solutions,of the corresponding sequence of policies,and,ultimately,of the PIA.
基金supported by the Natural Science Foundation of China (U22A20214)。
文摘Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the rotor vibration in AMBs is to adopt a notch filter or adaptive filter in the AMB controller. However, these methods cannot obtain the precise amplitude and phase of the compensation current. Thus, they are not so effective in terms of suppressing the vibrations of the fundamental and other harmonic orders over the whole speed range. To improve the vibration suppression performance of AMBs,an adaptive filter based on Least Mean Square(LMS) is applied to extract the vibration signals from the rotor displacement signal. An Iterative Search Algorithm(ISA) is proposed in this paper to obtain the corresponding relationship between the compensation current and vibration signals. The ISA is responsible for searching the compensating amplitude and shifting phase online for the LMS filter, enabling the AMB controller to generate the corresponding compensation force for vibration suppression. The results of ISA are recorded to suppress vibration using the Look-Up Table(LUT) in variable speed range. Comprehensive simulations and experimental validations are carried out in fixed and variable speed range, and the results demonstrate that by employing the ISA, vibrations of the fundamental and other harmonic orders are suppressed effectively.
基金the National Key R&D Plan of China(No.2021YFE0105000)the National Natural Science Foundation of China(No.52074213)+1 种基金the Shaanxi Key R&D Plan Project(No.2021SF-472)the Yulin Science and Technology Plan Project(No.CXY-2020-036).
文摘Safety patrol inspection in chemical industrial parks is a complex multi-objective task with multiple degrees of freedom.Traditional pointer instruments with advantages like high reliability and strong adaptability to harsh environment,are widely applied in such parks.However,they rely on manual readings which have problems like heavy patrol workload,high labor cost,high false positives/negatives and poor timeliness.To address the above problems,this study proposes a path planning method for robot patrol in chemical industrial parks,where a path optimization model based on improved iterated local search and random variable neighborhood descent(ILS-RVND)algorithm is established by integrating the actual requirements of patrol tasks in chemical industrial parks.Further,the effectiveness of the model and algorithm is verified by taking real park data as an example.The results show that compared with GA and ILS-RVND,the improved algorithm reduces quantification cost by about 24%and saves patrol time by about 36%.Apart from shortening the patrol time of robots,optimizing their patrol path and reducing their maintenance loss,the proposed algorithm also avoids the untimely patrol of robots and enhances the safety factor of equipment.
基金Project supported by the National Natural Science Foundation of China (No.10472061)
文摘An auxiliary principle technique to study a class of generalized set-valued strongly nonlinear mixed variational-like inequalities is extended. The existence and uniqueness of the solution of the auxiliary problem for the generalized set-valued strongly nonlinear mixed variational-like inequalities are proved, a novel and innovative three-step iterative algorithm to compute approximate solution is constructed, and the existence of the solution of the generalized set-valued strongly nonlinear mixed variational-like inequality is shown using the auxiliary principle iterative sequences generated by the algorithm technique. The convergence of three-step is also proved.
文摘A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the solution process of the present method is simplified, and the computation efficiency as well as the reliability for obtaining all solutions is also improved. By application of the method to the mechanisms problems, the results are satisfactory.
基金Project supported by the National Natural Science Foundation of China (Grant No.10271074), and the Special Funds for Major Specialities of Shanghai Education Commission (Grant No.J50101)
文摘In this paper, an improved gradient iterative (GI) algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.
基金Project supported by the Natural Science Foundation of Sichuan Educational Commission (No.2003A081)
文摘A new class of generalized mixed implicit quasi-equilibrium problems (GMIQEP) with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems and generalized mixed implicit quasi-variational inequality problems as many special cases. By employing the auxiliary principle technique, some predictor-corrector iterative algorithms for solving the GMIQEP are suggested and analyzed. The convergence of the suggested algorithm only requires the continuity and the partially relaxed implicit strong monotonicity of the mappings
文摘In this paper, on the basis of von Karman large deflection equations and its double trigonometric series solution, we present a simple, fast and effective iteration algorithm for solving simply-supported rectangular plate subjected to biaxial compression.
文摘It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.
文摘In this paper we use the auxiliary principle technique to suggest and analyze novel and innovative iterative algorithms for a class of nonlinear variational inequalities. Several special cases, which can be obtained from our main results, are also discussed.
基金This research is partially supported by NIH(No.R15EB024283).
文摘We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization(ML-EM)algorithm.In this study,we extend these algorithms to Bayesian algorithms.The family of emission-EM-lookalike algorithms utilizes a multiplicative update scheme.The extension of these algorithms to Bayesian algorithms is achieved by introducing a new simple factor,which contains the Bayesian information.One of the extended algorithms can be applied to emission tomography and another to transmission tomography.Computer simulations are performed and compared with the corresponding un-extended algorithms.The total-variation norm is employed as the Bayesian constraint in the computer simulations.The newly developed algorithms demonstrate a stable performance.A simple Bayesian algorithm can be derived for any noise variance function.The proposed algorithms have properties such as multiplicative updating,non-negativity,faster convergence rates for bright objects,and ease of implementation.Our algorithms are inspired by Green’s one-steplate algorithm.If written in additive-update form,Green’s algorithm has a step size determined by the future image value,which is an undesirable feature that our algorithms do not have.
基金supported by the National Natural Science Foundation of China(22078166)。
文摘A large amount of waste liquids containing methanol/acetone/water mixtures are produced in the synthesis of methyl methacrylate(MMA).Under the advocacy of green chemical industry,it is urgent to develop an efficient,economic and energy-saving mixture separation process.Through thermodynamic azeotropic behavior and pressure sensitivity analysis,pressure-swing distillation was determined and the optimal separation pressure of each column in the process was obtained.Due to the composition of waste liquids produced were quite different in MMA production,the pressure-swing distillation separation process was designed to fully achieve the accurate waste liquids treatment.Taking the total annual cost(TAC)as the target,the sequential iteration method was used to optimize the process,and the impact of composition on economy was compared.In order to further realize the energy-saving of the separation process,the pervaporation membrane module was introduced to pretreat the waste liquid in the pressure-swing distillation.The results showed that the TAC of the coupling process was 46% higher than that of the pressure-swing distillation process,and the thermodynamic efficiency was 30% higher.This study provides waste liquid treatment technology for enterprises and analyzes its economic and energy efficiency,which has reference significance for the development of coupled separation technology.
基金funded by the NSFC under Grant Nos.61803279,71471091,62003231 and 51874205in part by the Qing Lan Project of Jiangsu,in part by the China Postdoctoral Science Foundation under Grant Nos.2020M671596 and 2021M692369+2 种基金in part by the Suzhou Science and Technology Development Plan Project(Key Industry Technology Innovation)under Grant No.SYG202114in part by the Natural Science Foundation of Jiangsu Province under Grant No.BK20200989Postdoctoral Research Funding Program of Jiangsu Province.
文摘Discrete Tomography(DT)is a technology that uses image projection to reconstruct images.Its reconstruction problem,especially the binary image(0–1matrix)has attracted strong attention.In this study,a fixed point iterative method of integer programming based on intelligent optimization is proposed to optimize the reconstructedmodel.The solution process can be divided into two procedures.First,the DT problem is reformulated into a polyhedron judgment problembased on lattice basis reduction.Second,the fixed-point iterativemethod of Dang and Ye is used to judge whether an integer point exists in the polyhedron of the previous program.All the programs involved in this study are written in MATLAB.The final experimental data show that this method is obviously better than the branch and bound method in terms of computational efficiency,especially in the case of high dimension.The branch and bound method requires more branch operations and takes a long time.It also needs to store a large number of leaf node boundaries and the corresponding consumptionmatrix,which occupies a largememory space.
基金supported by the National Natural Science Foundation of China,Grant Number 41961060by the Program for Innovative Research Team (in Science and Technology) in the University of Yunnan Province,Grant Number IRTSTYN+1 种基金by the Scientific Research Fund Project of the Education Department of Yunnan Province,Grant Numbers 2020J0256 and 2021J0438by the Postgraduate Scientific Research and Innovation Fund Project of Yunnan Normal University,Grant Number YJSJJ21-A08
文摘Airborne laser scanning(ALS)and terrestrial laser scanning(TLS)has attracted attention due to their forest parameter investigation and research applications.ALS is limited to obtaining fi ne structure information below the forest canopy due to the occlusion of trees in natural forests.In contrast,TLS is unable to gather fi ne structure information about the upper canopy.To address the problem of incomplete acquisition of natural forest point cloud data by ALS and TLS on a single platform,this study proposes data registration without control points.The ALS and TLS original data were cropped according to sample plot size,and the ALS point cloud data was converted into relative coordinates with the center of the cropped data as the origin.The same feature point pairs of the ALS and TLS point cloud data were then selected to register the point cloud data.The initial registered point cloud data was fi nely and optimally registered via the iterative closest point(ICP)algorithm.The results show that the proposed method achieved highprecision registration of ALS and TLS point cloud data from two natural forest plots of Pinus yunnanensis Franch.and Picea asperata Mast.which included diff erent species and environments.An average registration accuracy of 0.06 m and 0.09 m were obtained for P.yunnanensis and P.asperata,respectively.
文摘In this paper, we use resolvent operator technology to construct a viscosity approximate algorithm to approximate a common solution of split variational inclusion problem and split fixed point problem for an averaged mapping in real Hilbert spaces. Further, we prove that the sequences generated by the proposed iterative method converge strongly to a common solution of split variational inclusion problem and split fixed point problem for averaged mappings which is also the unique solution of the variational inequality problem. The results presented here improve and extend the corresponding results in this area.
基金supported by the National Natural Science Foundation of China(Nos.12171496,12171490,11971491 and U1811461)Guangdong Basic and Applied Basic Research Foundation(2024A1515012057)。
文摘The one-bit compressed sensing problem is of fundamental importance in many areas,such as wireless communication,statistics,and so on.However,the optimization of one-bit problem coustrained on the unit sphere lacks an algorithm with rigorous mathematical proof of convergence and validity.In this paper,an iteration algorithm is established based on difference-of-convex algorithm for the one-bit compressed sensing problem constrained on the unit sphere,with iterating formula■,where C is the convex cone generated by the one-bit measurements andη_(1)>η_(2)>1/2.The new algorithm is proved to converge as long as the initial point is on the unit sphere and accords with the measurements,and the convergence to the global minimum point of the l_(1)norm is discussed.
基金the National Natural Science Foundation of China (90407007 60372001).
文摘To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform (STFT) is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.
基金This work was supported by the China Scholarship Council Scholarship,the National Key Research and Development Program of China(2017YFB0306400)the National Natural Science Foundation of China(62073069)the Deanship of Scientific Research(DSR)at King Abdulaziz University(RG-48-135-40).
文摘Group scheduling problems have attracted much attention owing to their many practical applications.This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-dependent setup time,release time,and due time.It is originated from an important industrial process,i.e.,wire rod and bar rolling process in steel production systems.Two objective functions,i.e.,the number of late jobs and total setup time,are minimized.A mixed integer linear program is established to describe the problem.To obtain its Pareto solutions,we present a memetic algorithm that integrates a population-based nondominated sorting genetic algorithm II and two single-solution-based improvement methods,i.e.,an insertion-based local search and an iterated greedy algorithm.The computational results on extensive industrial data with the scale of a one-week schedule show that the proposed algorithm has great performance in solving the concerned problem and outperforms its peers.Its high accuracy and efficiency imply its great potential to be applied to solve industrial-size group scheduling problems.