A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. ...A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. As a result, two key problems, i.e. , when to cooperate and how to cooperate, are solved. For the first problem, a proposed cooperation condition that can decide when to cooperate and guarantee users＇ energy efficiency achieved through cooperation is not lower than that achieved without cooperation. For the second problem, the cooperation bandwidth allocations （CBAs） based on the NBS solve the problem how to cooperate when cooperation takes place. Simulation results show that, as the modulation order of quadrature amplitude modulation （QAM） increases, the cooperation between both users only occurs with a large signal-to-noise ratio （SNR）. Meanwhile, the energy efficiency decreases as the modulation order increases. Despite all this, the proposed algorithm can obviously improve the energy efficiency measured in bits-per-Joule compared with non-cooperation.展开更多
Dual three-phase Permanent Magnet Synchronous Motor(DTP-PMSM)is a nonlinear,strongly coupled,high-order multivariable system.In today’s application scenarios,it is difficult for traditional PI controllers to meet the...Dual three-phase Permanent Magnet Synchronous Motor(DTP-PMSM)is a nonlinear,strongly coupled,high-order multivariable system.In today’s application scenarios,it is difficult for traditional PI controllers to meet the requirements of fast response,high accuracy and good robustness.In order to improve the performance of DTP-PMSM speed regulation system,a control strategy of PI controller based on genetic algorithm is proposed.Firstly,the basic mathematical model of DTP-PMSM is established,and the PI parameters of DTP-PMSM speed regulation system are optimized by genetic algorithm,and the modeling and simulation experiments of DTP-PMSM control system are carried out by MATLAB/SIMULINK.The simulation results show that,compared with the traditional PI control,the proposed algorithm significantly improves the performance of the control system,and the speed output overshoot of the GA-PI speed control system is smaller.The anti-interference ability is stronger,and the torque and double three-phase current output fluctuations are smaller.展开更多
In this paper,an algorithm is developed for using the G' /G-expansion method to obtain exact solutions for discrete nonlinear systems.Applying this method,some kinds of travelling wave solutions for AL system and ...In this paper,an algorithm is developed for using the G' /G-expansion method to obtain exact solutions for discrete nonlinear systems.Applying this method,some kinds of travelling wave solutions for AL system and Toda lattice system are derived.These solutions are expressed by hyperbolic function,trigonometric function and rational function with parameters.When the parameters are taken as special values,some known solutions including kink-type solitary wave solution and singular travelling wave solution are recovered. It is shown that the developed algorithm is effective and direct.It also can be used for many other nonlinear differential-difference equations in mathematical physics.展开更多
The steady state solution of long slender marine structures simply indicates the steady motion response to the excitation at top of the structure.It is very crucial especially for deep towing systems to find out how t...The steady state solution of long slender marine structures simply indicates the steady motion response to the excitation at top of the structure.It is very crucial especially for deep towing systems to find out how the towed body and towing cable work under certain towing speed.This paper has presented a direct algorithm using Runge-Kutta method for steady-state solution of long slender cylindrical structures and compared to the time iteration calculation;the direct algorithm spends much less time than the time-iteration scheme.Therefore, the direct algorithm proposed in this paper is quite efficient in providing credible reference for marine engineering applications.展开更多
In this paper,we study the nonlinear matrix equation X-A^(H)X^(-1)A=Q,where A,Q∈C^(n×n),Q is a Hermitian positive definite matrix and X∈C^(n×n)is an unknown matrix.We prove that the equation always has a u...In this paper,we study the nonlinear matrix equation X-A^(H)X^(-1)A=Q,where A,Q∈C^(n×n),Q is a Hermitian positive definite matrix and X∈C^(n×n)is an unknown matrix.We prove that the equation always has a unique Hermitian positive definite solution.We present two structure-preserving-doubling like algorithms to find the Hermitian positive definite solution of the equation,and the convergence theories are established.Finally,we show the effectiveness of the algorithms by numerical experiments.展开更多
This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the se...This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value.展开更多
The blockchain trilemma—balancing decentralization,security,and scalability—remains a critical challenge in distributed ledger technology.Despite significant advancements,achieving all three attributes simultaneousl...The blockchain trilemma—balancing decentralization,security,and scalability—remains a critical challenge in distributed ledger technology.Despite significant advancements,achieving all three attributes simultaneously continues to elude most blockchain systems,often forcing trade-offs that limit their real-world applicability.This review paper synthesizes current research efforts aimed at resolving the trilemma,focusing on innovative consensus mechanisms,sharding techniques,layer-2 protocols,and hybrid architectural models.We critically analyze recent breakthroughs,including Directed Acyclic Graph(DAG)-based structures,cross-chain interoperability frameworks,and zero-knowledge proof(ZKP)enhancements,which aimto reconcile scalability with robust security and decentralization.Furthermore,we evaluate the trade-offs inherent in these approaches,highlighting their practical implications for enterprise adoption,decentralized finance(DeFi),and Web3 ecosystems.By mapping the evolving landscape of solutions,this review identifies gaps in currentmethodologies and proposes future research directions,such as adaptive consensus algorithms and artificial intelligence-driven(AI-driven)governance models.Our analysis underscores that while no universal solution exists,interdisciplinary innovations are progressively narrowing the trilemma’s constraints,paving the way for next-generation blockchain infrastructures.展开更多
This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obt...This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.展开更多
The idea of AC = BD was applied to solve the nonlinear differential equations. Suppose that Au = 0 is a given equation to he solved and Dv = 0 is an equation to be easily solved. If the transformation u = Cv is obtain...The idea of AC = BD was applied to solve the nonlinear differential equations. Suppose that Au = 0 is a given equation to he solved and Dv = 0 is an equation to be easily solved. If the transformation u = Cv is obtained so that v satisfies Dv = 0, then the solutions for Au = 0 can be found. In order to illustrate this approach, several examples about the transformation C are given.展开更多
We develop a new evolutionary method of generating epsilon-efficient solutions of a continuous multiobjective programming problem. This is achieved by discretizing the problem and then using a genetic algorithm with s...We develop a new evolutionary method of generating epsilon-efficient solutions of a continuous multiobjective programming problem. This is achieved by discretizing the problem and then using a genetic algorithm with some derived probabilistic stopping criteria to obtain all minimal solutions for the discretized problem. We prove that these minimal solutions are the epsilon-optimal solutions to the original problem. We also present some computational examples illustrating the efficiency of our method.展开更多
A novel heuristic technique has been developed for solving Ordinary Differential Equation (ODE) numerically under the framework of Genetic Algorithm (GA). The method incorporates a sniffer procedure that helps carry o...A novel heuristic technique has been developed for solving Ordinary Differential Equation (ODE) numerically under the framework of Genetic Algorithm (GA). The method incorporates a sniffer procedure that helps carry out a memetic search within the solution domain in the vicinity of the currently found best chromosome. The technique has been successfully applied to the Korteweg- de Vries (KdV) equation, a well-known nonlinear Partial Differential Equation (PDE). In the present study we consider its solution in the regime of solitary waves, or solitons that is first used to convert the PDE into an ODE. It is then shown that using the sniffer technique assisted GA procedure, numerical solution has successfully been generated quite efficiently for the one-dimensional ODE version of the KdV equation in space variable (x). The technique is quite promising for its applications to systems involving ODE equations where analytical solutions are not directly available.展开更多
In this paper we proposed an AMH Supply Chain model to obtain optimal solutions for Two-, Three- and Four-Stage for deterministic models. Besides deriving its algebraic solutions, a simple searching method is successf...In this paper we proposed an AMH Supply Chain model to obtain optimal solutions for Two-, Three- and Four-Stage for deterministic models. Besides deriving its algebraic solutions, a simple searching method is successfully applied in obtaining optimal total costs and its integer multipliers. Our model has shown promising results in comparison to Equal Cycle Time and other existing ones. The tests focused on obtaining optimal total annual costs and other related details of Two-, Three- and Four-Stage for deterministic models. The results are run under Visual Basic Programming platform using Intel? CoreTM2 Duo T6500 Processor.展开更多
In predictive direct power control(PDPC)system of three-phase pulse width modulation(PWM)rectifier,grid voltage sensor makes the whole system more complex and costly.Therefore,third-order generalized integrator(TOGI)i...In predictive direct power control(PDPC)system of three-phase pulse width modulation(PWM)rectifier,grid voltage sensor makes the whole system more complex and costly.Therefore,third-order generalized integrator(TOGI)is used to generate orthogonal signals with the same frequency to estimate the grid voltage.In addition,in view of the deviation between actual and reference power in the three-phase PWM rectifier traditional PDPC strategy,a power correction link is designed to correct the power reference value.The grid voltage sensor free algorithm based on TOGI and the corrected PDPC strategy are applied to three-phase PWM rectifier and simulated on the simulation platform.Simulation results show that the proposed method can effectively eliminate the power tracking deviation and the grid voltage.The effectiveness of the proposed method is verified by comparing the simulation results.展开更多
The persistently high incidence of breast cancer emphasizes the need for precise detection in its diagnosis.Computer-aided medical systems are designed to provide accurate information and reduce human errors,in which ...The persistently high incidence of breast cancer emphasizes the need for precise detection in its diagnosis.Computer-aided medical systems are designed to provide accurate information and reduce human errors,in which accurate and effective segmentation of medical images plays a pivotal role in improving clinical outcomes.Multilevel Threshold Image Segmentation(MTIS)is widely favored due to its stability and straightforward implementation.Especially when dealing with sophisticated anatomical structures,high-level thresholding is a crucial technique in identifying fine details.To enhance the accuracy of complex breast cancer image segmentation,this paper proposes an improved version of RIME optimizer EECRIME,denoted as the double Enhanced solution quality Crisscross RIME algorithm.The original RIME initially conducts an efficient optimization to target promising solutions.The double-enhanced solution quality(EESQ)mechanism is proposed for thorough exploitation without falling into local optimum.In contrast,the crisscross operations perform a further local exploration of the generated feasible solutions.The performance of EECRIME is verified with basic and advanced algorithms on IEEE CEC2017 benchmark functions.Furthermore,an EECRIME-based MTIS method in combination with Kapur’s entropy is applied to segment breast Infiltrating Ductal Carcinoma(IDC)histology images.The results demonstrate that the developed model significantly surpasses its competitors,establishing it as a practical approach for complex medical image processing.展开更多
This paper treats multi-objective problem for manufacturing process design. A purpose of the process design is to decide combinations of work elements assigned to different work centers. Multiple work elements are ord...This paper treats multi-objective problem for manufacturing process design. A purpose of the process design is to decide combinations of work elements assigned to different work centers. Multiple work elements are ordinarily assigned to each center. Here, infeasible solutions are easily generated by precedence relationship of work elements in process design. The number of infeasible solutions generated is ordinarily larger than that of feasible solutions generated in the process. Therefore, feasible and infeasible solutions are located in any neighborhood in solution space. It is difficult to seek high quality Pareto solutions in this problem by using conventional multi-objective evolutional algorithms. We consider that the problem includes difficulty to seek high quality solutions by the following characteristics： （1） Since infeasible solutions are resemble to good feasible solutions, many infeasible solutions which have good values of objective functions are easily sought in the search process, （2） Infeasible solutions are useful to select new variable conditions generating good feasible solutions in search process. In this study, a multi-objective genetic algorithm including local search is proposed using these characteristics. Maximum value of average operation times and maximum value of dispersion of operation time in all work centers are used as objective functions to promote productivity. The optimal weighted coefficient is introduced to control the ratio of feasible solutions to all solutions selected in crossover and selection process in the algorithm. This paper shows the effectiveness of the proposed algorithm on simple model.展开更多
Dykstra’s alternating projection algorithm was proposed to treat the problem of finding the projection of a given point onto the intersection of some closed convex sets. In this paper, we first apply Dykstra’s alter...Dykstra’s alternating projection algorithm was proposed to treat the problem of finding the projection of a given point onto the intersection of some closed convex sets. In this paper, we first apply Dykstra’s alternating projection algorithm to compute the optimal approximate symmetric positive semidefinite solution of the matrix equations AXB = E, CXD = F. If we choose the initial iterative matrix X<sub>0</sub> = 0, the least Frobenius norm symmetric positive semidefinite solution of these matrix equations is obtained. A numerical example shows that the new algorithm is feasible and effective.展开更多
A new approach for solving polynomial equations is presented in this study. Two techniques for solving quartic equations are described that are based on a new method which was recently developed for solving cubic equa...A new approach for solving polynomial equations is presented in this study. Two techniques for solving quartic equations are described that are based on a new method which was recently developed for solving cubic equations. Higher order polynomial equations are solved by using a new and efficient algorithmic technique. The proposed methods rely on initially identifying the vicinities of the roots and do not require the use of complicated formulas, roots of complex numbers, or application of graphs. It is proposed that under the stated conditions, the methods presented provide efficient techniques to find the roots of polynomial equations.展开更多
Based on a first-order nonlinear ordinary differential equation with six-degree nonlinear term, we first present a new auxiliary equation expansion method and its algorithm. Being concise and straightforward, the meth...Based on a first-order nonlinear ordinary differential equation with six-degree nonlinear term, we first present a new auxiliary equation expansion method and its algorithm. Being concise and straightforward, the method is applied to the Kundu equation. As a result, some new exact travelling wave solutions are obtained, which include bright and dark solitary wave solutions, triangular periodic wave solutions, and singular solutions. This algorithm can also be applied to other nonlinear evolution equations in mathematical physics.展开更多
Quasi-periodic responses can appear in a wide variety of nonlinear dynamical systems. To the best of our knowledge, it has been a tough job for years to solve quasi-periodic solutions, even by numerical algorithms. He...Quasi-periodic responses can appear in a wide variety of nonlinear dynamical systems. To the best of our knowledge, it has been a tough job for years to solve quasi-periodic solutions, even by numerical algorithms. Here in this paper, we will present effective and accurate algorithms for quasi-periodic solutions by improving Wilson-θ and Newmark-β methods, respectively. In both the two methods, routinely, the considered equations are rearranged in the form of incremental equilibrium equations with the coefficient matrixes being updated in each time step. In this study, the two methods are improved via a predictor-corrector algorithm without updating the coefficient matrixes, in which the predicted solution at one time point can be corrected to the true one at the next. Numerical examples show that, both the improved Wilson-θ and Newmark-β methods can provide much more accurate quasi-periodic solutions with a smaller amount of computational resources. With a simple way to adjust the convergence of the iterations, the improved methods can even solve some quasi-periodic systems effectively, for which the original methods cease to be valid.展开更多
In this paper, we consider an extragradient thresholding algorithm for finding the sparse solution of mixed complementarity problems (MCPs). We establish a relaxation l1 regularized projection minimization model for t...In this paper, we consider an extragradient thresholding algorithm for finding the sparse solution of mixed complementarity problems (MCPs). We establish a relaxation l1 regularized projection minimization model for the original problem and design an extragradient thresholding algorithm (ETA) to solve the regularized model. Furthermore, we prove that any cluster point of the sequence generated by ETA is a solution of MCP. Finally, numerical experiments show that the ETA algorithm can effectively solve the l1 regularized projection minimization model and obtain the sparse solution of the mixed complementarity problem.展开更多
基金The National Natural Science Foundation of China(No.61201143)Innovation Foundations of CAST(ITS)(No.F-WYY-2013-016)the Fundamental Research Funds for the Central Universities(No.HIT.IBRSEM.201309)
文摘A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. As a result, two key problems, i.e. , when to cooperate and how to cooperate, are solved. For the first problem, a proposed cooperation condition that can decide when to cooperate and guarantee users＇ energy efficiency achieved through cooperation is not lower than that achieved without cooperation. For the second problem, the cooperation bandwidth allocations （CBAs） based on the NBS solve the problem how to cooperate when cooperation takes place. Simulation results show that, as the modulation order of quadrature amplitude modulation （QAM） increases, the cooperation between both users only occurs with a large signal-to-noise ratio （SNR）. Meanwhile, the energy efficiency decreases as the modulation order increases. Despite all this, the proposed algorithm can obviously improve the energy efficiency measured in bits-per-Joule compared with non-cooperation.
基金supported in part by the Liaoning Provincial Department of Education Key Research Project under JYT2020160by the Liaoning Provincial Department of Education General Project under LJKZ0224。
文摘Dual three-phase Permanent Magnet Synchronous Motor(DTP-PMSM)is a nonlinear,strongly coupled,high-order multivariable system.In today’s application scenarios,it is difficult for traditional PI controllers to meet the requirements of fast response,high accuracy and good robustness.In order to improve the performance of DTP-PMSM speed regulation system,a control strategy of PI controller based on genetic algorithm is proposed.Firstly,the basic mathematical model of DTP-PMSM is established,and the PI parameters of DTP-PMSM speed regulation system are optimized by genetic algorithm,and the modeling and simulation experiments of DTP-PMSM control system are carried out by MATLAB/SIMULINK.The simulation results show that,compared with the traditional PI control,the proposed algorithm significantly improves the performance of the control system,and the speed output overshoot of the GA-PI speed control system is smaller.The anti-interference ability is stronger,and the torque and double three-phase current output fluctuations are smaller.
基金Supported by the Natural Science Foundation of the Education Department of Henan Province(2006110002,2007110010)
文摘In this paper,an algorithm is developed for using the G' /G-expansion method to obtain exact solutions for discrete nonlinear systems.Applying this method,some kinds of travelling wave solutions for AL system and Toda lattice system are derived.These solutions are expressed by hyperbolic function,trigonometric function and rational function with parameters.When the parameters are taken as special values,some known solutions including kink-type solitary wave solution and singular travelling wave solution are recovered. It is shown that the developed algorithm is effective and direct.It also can be used for many other nonlinear differential-difference equations in mathematical physics.
基金the National Natural Science Foundation of China(Nos.51009092 and 50909061)the Doctoral Foundation of Education Ministry of China (No.20090073120013)the National High Technology Research and Development Program (863) of China (No.2008AA092301-1)
文摘The steady state solution of long slender marine structures simply indicates the steady motion response to the excitation at top of the structure.It is very crucial especially for deep towing systems to find out how the towed body and towing cable work under certain towing speed.This paper has presented a direct algorithm using Runge-Kutta method for steady-state solution of long slender cylindrical structures and compared to the time iteration calculation;the direct algorithm spends much less time than the time-iteration scheme.Therefore, the direct algorithm proposed in this paper is quite efficient in providing credible reference for marine engineering applications.
基金This research is supported by the National Natural Science Foundation of China(No.11871444).
文摘In this paper,we study the nonlinear matrix equation X-A^(H)X^(-1)A=Q,where A,Q∈C^(n×n),Q is a Hermitian positive definite matrix and X∈C^(n×n)is an unknown matrix.We prove that the equation always has a unique Hermitian positive definite solution.We present two structure-preserving-doubling like algorithms to find the Hermitian positive definite solution of the equation,and the convergence theories are established.Finally,we show the effectiveness of the algorithms by numerical experiments.
基金supported by the National Basic Research Program of China(Grant No.2013CB338002)
文摘This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value.
文摘The blockchain trilemma—balancing decentralization,security,and scalability—remains a critical challenge in distributed ledger technology.Despite significant advancements,achieving all three attributes simultaneously continues to elude most blockchain systems,often forcing trade-offs that limit their real-world applicability.This review paper synthesizes current research efforts aimed at resolving the trilemma,focusing on innovative consensus mechanisms,sharding techniques,layer-2 protocols,and hybrid architectural models.We critically analyze recent breakthroughs,including Directed Acyclic Graph(DAG)-based structures,cross-chain interoperability frameworks,and zero-knowledge proof(ZKP)enhancements,which aimto reconcile scalability with robust security and decentralization.Furthermore,we evaluate the trade-offs inherent in these approaches,highlighting their practical implications for enterprise adoption,decentralized finance(DeFi),and Web3 ecosystems.By mapping the evolving landscape of solutions,this review identifies gaps in currentmethodologies and proposes future research directions,such as adaptive consensus algorithms and artificial intelligence-driven(AI-driven)governance models.Our analysis underscores that while no universal solution exists,interdisciplinary innovations are progressively narrowing the trilemma’s constraints,paving the way for next-generation blockchain infrastructures.
基金This project is supported by the National Natural Science Foundation of China
文摘This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.
文摘The idea of AC = BD was applied to solve the nonlinear differential equations. Suppose that Au = 0 is a given equation to he solved and Dv = 0 is an equation to be easily solved. If the transformation u = Cv is obtained so that v satisfies Dv = 0, then the solutions for Au = 0 can be found. In order to illustrate this approach, several examples about the transformation C are given.
文摘We develop a new evolutionary method of generating epsilon-efficient solutions of a continuous multiobjective programming problem. This is achieved by discretizing the problem and then using a genetic algorithm with some derived probabilistic stopping criteria to obtain all minimal solutions for the discretized problem. We prove that these minimal solutions are the epsilon-optimal solutions to the original problem. We also present some computational examples illustrating the efficiency of our method.
文摘A novel heuristic technique has been developed for solving Ordinary Differential Equation (ODE) numerically under the framework of Genetic Algorithm (GA). The method incorporates a sniffer procedure that helps carry out a memetic search within the solution domain in the vicinity of the currently found best chromosome. The technique has been successfully applied to the Korteweg- de Vries (KdV) equation, a well-known nonlinear Partial Differential Equation (PDE). In the present study we consider its solution in the regime of solitary waves, or solitons that is first used to convert the PDE into an ODE. It is then shown that using the sniffer technique assisted GA procedure, numerical solution has successfully been generated quite efficiently for the one-dimensional ODE version of the KdV equation in space variable (x). The technique is quite promising for its applications to systems involving ODE equations where analytical solutions are not directly available.
文摘In this paper we proposed an AMH Supply Chain model to obtain optimal solutions for Two-, Three- and Four-Stage for deterministic models. Besides deriving its algebraic solutions, a simple searching method is successfully applied in obtaining optimal total costs and its integer multipliers. Our model has shown promising results in comparison to Equal Cycle Time and other existing ones. The tests focused on obtaining optimal total annual costs and other related details of Two-, Three- and Four-Stage for deterministic models. The results are run under Visual Basic Programming platform using Intel? CoreTM2 Duo T6500 Processor.
基金National Natural Science Foundation of China(Nos.51767013,52067013)。
文摘In predictive direct power control(PDPC)system of three-phase pulse width modulation(PWM)rectifier,grid voltage sensor makes the whole system more complex and costly.Therefore,third-order generalized integrator(TOGI)is used to generate orthogonal signals with the same frequency to estimate the grid voltage.In addition,in view of the deviation between actual and reference power in the three-phase PWM rectifier traditional PDPC strategy,a power correction link is designed to correct the power reference value.The grid voltage sensor free algorithm based on TOGI and the corrected PDPC strategy are applied to three-phase PWM rectifier and simulated on the simulation platform.Simulation results show that the proposed method can effectively eliminate the power tracking deviation and the grid voltage.The effectiveness of the proposed method is verified by comparing the simulation results.
基金supported in part by the Natural Science Foundation of Zhejiang Province(LZ22F020005)National Natural Science Foundation of China(62076185,62301367).
文摘The persistently high incidence of breast cancer emphasizes the need for precise detection in its diagnosis.Computer-aided medical systems are designed to provide accurate information and reduce human errors,in which accurate and effective segmentation of medical images plays a pivotal role in improving clinical outcomes.Multilevel Threshold Image Segmentation(MTIS)is widely favored due to its stability and straightforward implementation.Especially when dealing with sophisticated anatomical structures,high-level thresholding is a crucial technique in identifying fine details.To enhance the accuracy of complex breast cancer image segmentation,this paper proposes an improved version of RIME optimizer EECRIME,denoted as the double Enhanced solution quality Crisscross RIME algorithm.The original RIME initially conducts an efficient optimization to target promising solutions.The double-enhanced solution quality(EESQ)mechanism is proposed for thorough exploitation without falling into local optimum.In contrast,the crisscross operations perform a further local exploration of the generated feasible solutions.The performance of EECRIME is verified with basic and advanced algorithms on IEEE CEC2017 benchmark functions.Furthermore,an EECRIME-based MTIS method in combination with Kapur’s entropy is applied to segment breast Infiltrating Ductal Carcinoma(IDC)histology images.The results demonstrate that the developed model significantly surpasses its competitors,establishing it as a practical approach for complex medical image processing.
文摘This paper treats multi-objective problem for manufacturing process design. A purpose of the process design is to decide combinations of work elements assigned to different work centers. Multiple work elements are ordinarily assigned to each center. Here, infeasible solutions are easily generated by precedence relationship of work elements in process design. The number of infeasible solutions generated is ordinarily larger than that of feasible solutions generated in the process. Therefore, feasible and infeasible solutions are located in any neighborhood in solution space. It is difficult to seek high quality Pareto solutions in this problem by using conventional multi-objective evolutional algorithms. We consider that the problem includes difficulty to seek high quality solutions by the following characteristics： （1） Since infeasible solutions are resemble to good feasible solutions, many infeasible solutions which have good values of objective functions are easily sought in the search process, （2） Infeasible solutions are useful to select new variable conditions generating good feasible solutions in search process. In this study, a multi-objective genetic algorithm including local search is proposed using these characteristics. Maximum value of average operation times and maximum value of dispersion of operation time in all work centers are used as objective functions to promote productivity. The optimal weighted coefficient is introduced to control the ratio of feasible solutions to all solutions selected in crossover and selection process in the algorithm. This paper shows the effectiveness of the proposed algorithm on simple model.
文摘Dykstra’s alternating projection algorithm was proposed to treat the problem of finding the projection of a given point onto the intersection of some closed convex sets. In this paper, we first apply Dykstra’s alternating projection algorithm to compute the optimal approximate symmetric positive semidefinite solution of the matrix equations AXB = E, CXD = F. If we choose the initial iterative matrix X<sub>0</sub> = 0, the least Frobenius norm symmetric positive semidefinite solution of these matrix equations is obtained. A numerical example shows that the new algorithm is feasible and effective.
文摘A new approach for solving polynomial equations is presented in this study. Two techniques for solving quartic equations are described that are based on a new method which was recently developed for solving cubic equations. Higher order polynomial equations are solved by using a new and efficient algorithmic technique. The proposed methods rely on initially identifying the vicinities of the roots and do not require the use of complicated formulas, roots of complex numbers, or application of graphs. It is proposed that under the stated conditions, the methods presented provide efficient techniques to find the roots of polynomial equations.
文摘Based on a first-order nonlinear ordinary differential equation with six-degree nonlinear term, we first present a new auxiliary equation expansion method and its algorithm. Being concise and straightforward, the method is applied to the Kundu equation. As a result, some new exact travelling wave solutions are obtained, which include bright and dark solitary wave solutions, triangular periodic wave solutions, and singular solutions. This algorithm can also be applied to other nonlinear evolution equations in mathematical physics.
文摘Quasi-periodic responses can appear in a wide variety of nonlinear dynamical systems. To the best of our knowledge, it has been a tough job for years to solve quasi-periodic solutions, even by numerical algorithms. Here in this paper, we will present effective and accurate algorithms for quasi-periodic solutions by improving Wilson-θ and Newmark-β methods, respectively. In both the two methods, routinely, the considered equations are rearranged in the form of incremental equilibrium equations with the coefficient matrixes being updated in each time step. In this study, the two methods are improved via a predictor-corrector algorithm without updating the coefficient matrixes, in which the predicted solution at one time point can be corrected to the true one at the next. Numerical examples show that, both the improved Wilson-θ and Newmark-β methods can provide much more accurate quasi-periodic solutions with a smaller amount of computational resources. With a simple way to adjust the convergence of the iterations, the improved methods can even solve some quasi-periodic systems effectively, for which the original methods cease to be valid.
文摘In this paper, we consider an extragradient thresholding algorithm for finding the sparse solution of mixed complementarity problems (MCPs). We establish a relaxation l1 regularized projection minimization model for the original problem and design an extragradient thresholding algorithm (ETA) to solve the regularized model. Furthermore, we prove that any cluster point of the sequence generated by ETA is a solution of MCP. Finally, numerical experiments show that the ETA algorithm can effectively solve the l1 regularized projection minimization model and obtain the sparse solution of the mixed complementarity problem.
