Spectroscopy can be used for detecting crop characteristics. A goal of crop spectrum analysis is to extract effective features from spectral data for establishing a detection model. An ideal spectral feature set shoul...Spectroscopy can be used for detecting crop characteristics. A goal of crop spectrum analysis is to extract effective features from spectral data for establishing a detection model. An ideal spectral feature set should have high sensitivity to target parameters but low information redundancy among features.However, feature-selection methods that satisfy both requirements are lacking. To address this issue,in this study, a novel method, the continuous wavelet projections algorithm(CWPA), was developed,which has advantages of both continuous wavelet analysis(CWA) and the successive projections algorithm(SPA) for generating optimal spectral feature set for crop detection. Three datasets collected for crop stress detection and retrieval of biochemical properties were used to validate the CWPA under both classification and regression scenarios. The CWPA generated a feature set with fewer features yet achieving accuracy comparable to or even higher than those of CWA and SPA. With only two to three features identified by CWPA, an overall accuracy of 98% in classifying tea plant stresses was achieved, and high coefficients of determination were obtained in retrieving corn leaf chlorophyll content(R^(2)= 0.8521)and equivalent water thickness(R^(2)= 0.9508). The mechanism of the CWPA ensures that the novel algorithm discovers the most sensitive features while retaining complementarity among features. Its ability to reduce the data dimension suggests its potential for crop monitoring and phenotyping with hyperspectral data.展开更多
An ε-subgradient projection algorithm for solving a convex feasibility problem is presented.Based on the iterative projection methods and the notion of ε-subgradient,a series of special projection hyperplanes is est...An ε-subgradient projection algorithm for solving a convex feasibility problem is presented.Based on the iterative projection methods and the notion of ε-subgradient,a series of special projection hyperplanes is established.Moreover,compared with the existing projection hyperplanes methods with subgradient,the proposed hyperplanes are interactive with ε,and their ranges are more larger.The convergence of the proposed algorithm is given under some mild conditions,and the validity of the algorithm is proved by the numerical test.展开更多
In this paper,a zero-sum game Nash equilibrium computation problem with a common constraint set is investigated under two time-varying multi-agent subnetworks,where the two subnetworks have opposite payoff function.A ...In this paper,a zero-sum game Nash equilibrium computation problem with a common constraint set is investigated under two time-varying multi-agent subnetworks,where the two subnetworks have opposite payoff function.A novel distributed projection subgradient algorithm with random sleep scheme is developed to reduce the calculation amount of agents in the process of computing Nash equilibrium.In our algorithm,each agent is determined by an independent identically distributed Bernoulli decision to compute the subgradient and perform the projection operation or to keep the previous consensus estimate,it effectively reduces the amount of computation and calculation time.Moreover,the traditional assumption of stepsize adopted in the existing methods is removed,and the stepsizes in our algorithm are randomized diminishing.Besides,we prove that all agents converge to Nash equilibrium with probability 1 by our algorithm.Finally,a simulation example verifies the validity of our algorithm.展开更多
We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping...We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping is continuous and f-pseudomonotone with nonempty compact convex values on dom（f）, where f ： Rn --RU{＋∞} is a proper func- tion. The algorithm presented in this paper generalize and improve some known algorithms in literatures. Preliminary computational experience is also reported.展开更多
An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the obj...An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the objective of minimizing project duration Activities priorities for scheduling are represented by individual vectors and a senal scheme is utilized to transform the individual-represented priorities to a feasible schedule according to the precedence and resource constraints so as to be evaluated.To investigate the performance of the IDE-based approach for the RCPSP,it is compared against the meta-heuristic methods of hybrid genetic algorithm（HGA）,particle swarm optimization（PSO） and several well selected heuristics.The results show that the proposed scheduling method is better than general heuristic rules and is able to obtain the same optimal result as the HGA and PSO approaches but more efficient than the two algorithms.展开更多
A hybrid method for synthesizing antenna＇s three dimensional （3D） pattern is proposed to obtain the low sidelobe feature of truncated cone conformal phased arrays. In this method, the elements of truncated cone con...A hybrid method for synthesizing antenna＇s three dimensional （3D） pattern is proposed to obtain the low sidelobe feature of truncated cone conformal phased arrays. In this method, the elements of truncated cone conformal phased arrays are projected to the tangent plane in one generatrix of the truncated cone. Then two dimensional （2D） Chebyshev amplitude distribution optimization is respectively used in two mutual vertical directions of the tangent plane. According to the location of the elements, the excitation current amplitude distribution of each element on the conformal structure is derived reversely, then the excitation current amplitude is further optimized by using the genetic algorithm （GA）. A truncated cone problem with 8x8 elements on it, and a 3D pattern desired side lobe level （SLL） up to 35 dB, is studied. By using the hybrid method, the optimal goal is accomplished with acceptable CPU time, which indicates that this hybrid method for the low sidelobe synthesis is feasible.展开更多
This paper analyzes and dissertates the discrete wavelet transform and improved projection algorithm in four kernel stages （image preprocessing, license plate localization, character segmentation, license plate recog...This paper analyzes and dissertates the discrete wavelet transform and improved projection algorithm in four kernel stages （image preprocessing, license plate localization, character segmentation, license plate recognition, i.e.） of license plate recognition system in detail. At last, it gives some conclusions and suggestions on future research.展开更多
With the development of the compressive sensing theory, the image reconstruction from the projections viewed in limited angles is one of the hot problems in the research of computed tomography technology. This paper d...With the development of the compressive sensing theory, the image reconstruction from the projections viewed in limited angles is one of the hot problems in the research of computed tomography technology. This paper develops an iterative algorithm for image reconstruction, which can fit the most cases. This method gives an image reconstruction flow with the difference image vector, which is based on the concept that the difference image vector between the reconstructed and the reference image is sparse enough. Then the l1-norm minimization method is used to reconstruct the difference vector to recover the image for flat subjects in limited angles. The algorithm has been tested with a thin planar phantom and a real object in limited-view projection data. Moreover, all the studies showed the satisfactory results in accuracy at a rather high reconstruction speed.展开更多
Based on the fabricated 12-element cavity-backed microstrip sector cylinder array,a novel hybrid alternate projection algorithm（HAPA）,which combines analytical method with numerical techniques effectively,is propose...Based on the fabricated 12-element cavity-backed microstrip sector cylinder array,a novel hybrid alternate projection algorithm（HAPA）,which combines analytical method with numerical techniques effectively,is proposed for synthesizing the pattern of practical conformal array.The algorithm applies the variable direction aperture projection method with mutual coupling correction techniques to provide the good initial excitations of elements to the enhanced alternate projection algorithm（EAPA）.In order to do further optimization,which improves the convergent speed of the algorithm significantly.Finally,the HAPA has been applied to the fabricated sector cylinder array with mutual coupling considered.The results of synthesized patterns,such as low sidelobe with null points formed pattern,beam scanning with low sidelobe pattern and the shaped beam pattern are presented.It demonstrates the validity of HAPA in practical conformal array synthesis.展开更多
In this paper, we propose two hybrid inertial CQ projection algorithms with linesearch process for the split feasibility problem. Based on the hybrid CQ projection algorithm, we firstly add the inertial term into the ...In this paper, we propose two hybrid inertial CQ projection algorithms with linesearch process for the split feasibility problem. Based on the hybrid CQ projection algorithm, we firstly add the inertial term into the iteration to accelerate the convergence of the algorithm, and adopt flexible rules for selecting the stepsize and the shrinking projection region, which makes an optimal stepsize available at each iteration. The shrinking projection region is the intersection of three sets, which are the set C and two hyperplanes. Furthermore, we modify the Armijo-type line-search step in the presented algorithm to get a new algorithm.The algorithms are shown to be convergent under certain mild assumptions. Besides, numerical examples are given to show that the proposed algorithms have better performance than the general CQ algorithm.展开更多
Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been ...Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been researched.The simulations were made for the performance of these algorithms.The extraction of fetal electrocardiogram(FECG) is applied to compare the application effect of the above algorithms.The proposed FAP algorithm has obvious advantages in computational complexity,convergence speed and steadystate error.展开更多
Both fuzzy temporal constraint and flexible resource constraint are considered in project scheduling. In order to obtain an optimal schedule, we propose a genetic algorithm integrated with concepts on fuzzy set theory...Both fuzzy temporal constraint and flexible resource constraint are considered in project scheduling. In order to obtain an optimal schedule, we propose a genetic algorithm integrated with concepts on fuzzy set theory as well as specialized coding and decoding mechanism. An example demonstrates that the proposed approach can assist the project managers to obtain the optimal schedule effectively and make the correct decision on skill training before a project begins.展开更多
A new beam broadening synthesis technique for Synthetic Aperture Radar(SAR) antenna array, namely Projection Matrix Algorithm(PMA) is presented. The theory of PMA is introduced firstly, and then the iterative renewed ...A new beam broadening synthesis technique for Synthetic Aperture Radar(SAR) antenna array, namely Projection Matrix Algorithm(PMA) is presented. The theory of PMA is introduced firstly, and then the iterative renewed manner is improved to resolve the unbalance problem under amplitude and phase control. In order to validate the algorithm correct and effective, an actual engineering application example is investigated. The beam synthesis results of 1.0~4.5 times broadening under the phase only control and the amplitude and phase control using improved PMA are given. The results show that the beam directivity, the beam broadening, and the side-lobe level requirements were met. It is demonstrated that the improved PMA was effective and feasible for SAR application.展开更多
Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-lev...Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-level scheduling and project decomposition technology, and the genetic algorithm and tabu search is combined. Topological reordering technology is used to improve the efficiency of evaluation. Simulation results show the proposed algorithm can obtain satisfied scheduling results in acceptable time.展开更多
This paper introduces a hybrid evolutionary algorithm for the resource-constrained project scheduling problem (RCPSP). Given an RCPSP instance, the algorithm identifies the problem structure and selects a suitable dec...This paper introduces a hybrid evolutionary algorithm for the resource-constrained project scheduling problem (RCPSP). Given an RCPSP instance, the algorithm identifies the problem structure and selects a suitable decoding scheme. Then a multi-pass biased sampling method followed up by a multi-local search is used to generate a diverse and good quality initial population. The population then evolves through modified order-based recombination and mutation operators to perform exploration for promising solutions within the entire region. Mutation is performed only if the current population has converged or the produced offspring by recombination operator is too similar to one of his parents. Finally the algorithm performs an intensified local search on the best solution found in the evolutionary stage. Computational experiments using standard instances indicate that the proposed algorithm works well in both computational time and solution quality.展开更多
A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The f...A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.展开更多
The investment decision making of Project Gang, the projects that are associated with one another on economy and technique, is studied. In order to find out the best Scheme that can make the maximum profit, a dynami...The investment decision making of Project Gang, the projects that are associated with one another on economy and technique, is studied. In order to find out the best Scheme that can make the maximum profit, a dynamic programming algorithm on the investment decision making of Project Gang is brought forward, and this algorithm can find out the best Scheme of distributing the m resources to the n Items in the time of O(m 2 n).展开更多
基金supported by the National Natural Science Foundation of China (42071420)the Major Special Project for 2025 Scientific,Technological Innovation (Major Scientific and Technological Task Project in Ningbo City)(2021Z048)the National Key Research and Development Program of China(2019YFE0125300)。
文摘Spectroscopy can be used for detecting crop characteristics. A goal of crop spectrum analysis is to extract effective features from spectral data for establishing a detection model. An ideal spectral feature set should have high sensitivity to target parameters but low information redundancy among features.However, feature-selection methods that satisfy both requirements are lacking. To address this issue,in this study, a novel method, the continuous wavelet projections algorithm(CWPA), was developed,which has advantages of both continuous wavelet analysis(CWA) and the successive projections algorithm(SPA) for generating optimal spectral feature set for crop detection. Three datasets collected for crop stress detection and retrieval of biochemical properties were used to validate the CWPA under both classification and regression scenarios. The CWPA generated a feature set with fewer features yet achieving accuracy comparable to or even higher than those of CWA and SPA. With only two to three features identified by CWPA, an overall accuracy of 98% in classifying tea plant stresses was achieved, and high coefficients of determination were obtained in retrieving corn leaf chlorophyll content(R^(2)= 0.8521)and equivalent water thickness(R^(2)= 0.9508). The mechanism of the CWPA ensures that the novel algorithm discovers the most sensitive features while retaining complementarity among features. Its ability to reduce the data dimension suggests its potential for crop monitoring and phenotyping with hyperspectral data.
基金supported by the National Natural Science Foundation of China (10671126)Shanghai Leading Academic Discipline Project(S30501)
文摘An ε-subgradient projection algorithm for solving a convex feasibility problem is presented.Based on the iterative projection methods and the notion of ε-subgradient,a series of special projection hyperplanes is established.Moreover,compared with the existing projection hyperplanes methods with subgradient,the proposed hyperplanes are interactive with ε,and their ranges are more larger.The convergence of the proposed algorithm is given under some mild conditions,and the validity of the algorithm is proved by the numerical test.
文摘In this paper,a zero-sum game Nash equilibrium computation problem with a common constraint set is investigated under two time-varying multi-agent subnetworks,where the two subnetworks have opposite payoff function.A novel distributed projection subgradient algorithm with random sleep scheme is developed to reduce the calculation amount of agents in the process of computing Nash equilibrium.In our algorithm,each agent is determined by an independent identically distributed Bernoulli decision to compute the subgradient and perform the projection operation or to keep the previous consensus estimate,it effectively reduces the amount of computation and calculation time.Moreover,the traditional assumption of stepsize adopted in the existing methods is removed,and the stepsizes in our algorithm are randomized diminishing.Besides,we prove that all agents converge to Nash equilibrium with probability 1 by our algorithm.Finally,a simulation example verifies the validity of our algorithm.
基金supported by the Scientific Research Foundation of Sichuan Normal University(20151602)National Natural Science Foundation of China(10671135,61179033)and the Key Project of Chinese Ministry of Education(212147)
文摘We propose a projection-type algorithm for generalized mixed variational in- equality problem in Euclidean space Rn. We establish the convergence theorem for the pro- posed algorithm, provided the multi-valued mapping is continuous and f-pseudomonotone with nonempty compact convex values on dom（f）, where f ： Rn --RU{＋∞} is a proper func- tion. The algorithm presented in this paper generalize and improve some known algorithms in literatures. Preliminary computational experience is also reported.
基金supported by the National Natural Science Foundation of China(6083500460775047+4 种基金60974048)the National High Technology Research and Development Program of China(863 Program)(2007AA0422442008AA04Z214)the Natural Science Foundation of Hunan Province(09JJ9012)Scientific Research Fund of Hunan Provincial Education Department(08C337)
文摘An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the objective of minimizing project duration Activities priorities for scheduling are represented by individual vectors and a senal scheme is utilized to transform the individual-represented priorities to a feasible schedule according to the precedence and resource constraints so as to be evaluated.To investigate the performance of the IDE-based approach for the RCPSP,it is compared against the meta-heuristic methods of hybrid genetic algorithm（HGA）,particle swarm optimization（PSO） and several well selected heuristics.The results show that the proposed scheduling method is better than general heuristic rules and is able to obtain the same optimal result as the HGA and PSO approaches but more efficient than the two algorithms.
基金supported by the Fundamental Research Funds for the Central Universities(YWF-13D2-XX-13)the National High-tech Research and Development Program(863 Program)(2008AA121802)
文摘A hybrid method for synthesizing antenna＇s three dimensional （3D） pattern is proposed to obtain the low sidelobe feature of truncated cone conformal phased arrays. In this method, the elements of truncated cone conformal phased arrays are projected to the tangent plane in one generatrix of the truncated cone. Then two dimensional （2D） Chebyshev amplitude distribution optimization is respectively used in two mutual vertical directions of the tangent plane. According to the location of the elements, the excitation current amplitude distribution of each element on the conformal structure is derived reversely, then the excitation current amplitude is further optimized by using the genetic algorithm （GA）. A truncated cone problem with 8x8 elements on it, and a 3D pattern desired side lobe level （SLL） up to 35 dB, is studied. By using the hybrid method, the optimal goal is accomplished with acceptable CPU time, which indicates that this hybrid method for the low sidelobe synthesis is feasible.
文摘This paper analyzes and dissertates the discrete wavelet transform and improved projection algorithm in four kernel stages （image preprocessing, license plate localization, character segmentation, license plate recognition, i.e.） of license plate recognition system in detail. At last, it gives some conclusions and suggestions on future research.
基金Project supported by the National Basic Research Program of China(Grant No.2006CB7057005)the National High Technology Research and Development Program of China(Grant No.2009AA012200)the National Natural Science Foundation of China (Grant No.60672104)
文摘With the development of the compressive sensing theory, the image reconstruction from the projections viewed in limited angles is one of the hot problems in the research of computed tomography technology. This paper develops an iterative algorithm for image reconstruction, which can fit the most cases. This method gives an image reconstruction flow with the difference image vector, which is based on the concept that the difference image vector between the reconstructed and the reference image is sparse enough. Then the l1-norm minimization method is used to reconstruct the difference vector to recover the image for flat subjects in limited angles. The algorithm has been tested with a thin planar phantom and a real object in limited-view projection data. Moreover, all the studies showed the satisfactory results in accuracy at a rather high reconstruction speed.
文摘Based on the fabricated 12-element cavity-backed microstrip sector cylinder array,a novel hybrid alternate projection algorithm（HAPA）,which combines analytical method with numerical techniques effectively,is proposed for synthesizing the pattern of practical conformal array.The algorithm applies the variable direction aperture projection method with mutual coupling correction techniques to provide the good initial excitations of elements to the enhanced alternate projection algorithm（EAPA）.In order to do further optimization,which improves the convergent speed of the algorithm significantly.Finally,the HAPA has been applied to the fabricated sector cylinder array with mutual coupling considered.The results of synthesized patterns,such as low sidelobe with null points formed pattern,beam scanning with low sidelobe pattern and the shaped beam pattern are presented.It demonstrates the validity of HAPA in practical conformal array synthesis.
基金Supported by the National Natural Science Foundation of China(72071130)。
文摘In this paper, we propose two hybrid inertial CQ projection algorithms with linesearch process for the split feasibility problem. Based on the hybrid CQ projection algorithm, we firstly add the inertial term into the iteration to accelerate the convergence of the algorithm, and adopt flexible rules for selecting the stepsize and the shrinking projection region, which makes an optimal stepsize available at each iteration. The shrinking projection region is the intersection of three sets, which are the set C and two hyperplanes. Furthermore, we modify the Armijo-type line-search step in the presented algorithm to get a new algorithm.The algorithms are shown to be convergent under certain mild assumptions. Besides, numerical examples are given to show that the proposed algorithms have better performance than the general CQ algorithm.
基金the National Key Technologies R&D Program (No. 2006BAI22B01)
文摘Aimed at the problem of adaptive noise canceling(ANC),three implementary algorithms which are least mean square(LMS) algorithm,recursive least square(RLS) algorithm and fast affine projection(FAP) algorithm,have been researched.The simulations were made for the performance of these algorithms.The extraction of fetal electrocardiogram(FECG) is applied to compare the application effect of the above algorithms.The proposed FAP algorithm has obvious advantages in computational complexity,convergence speed and steadystate error.
基金Supported by the National Natural Science Foundation of China(No.71272146)
文摘Both fuzzy temporal constraint and flexible resource constraint are considered in project scheduling. In order to obtain an optimal schedule, we propose a genetic algorithm integrated with concepts on fuzzy set theory as well as specialized coding and decoding mechanism. An example demonstrates that the proposed approach can assist the project managers to obtain the optimal schedule effectively and make the correct decision on skill training before a project begins.
文摘A new beam broadening synthesis technique for Synthetic Aperture Radar(SAR) antenna array, namely Projection Matrix Algorithm(PMA) is presented. The theory of PMA is introduced firstly, and then the iterative renewed manner is improved to resolve the unbalance problem under amplitude and phase control. In order to validate the algorithm correct and effective, an actual engineering application example is investigated. The beam synthesis results of 1.0~4.5 times broadening under the phase only control and the amplitude and phase control using improved PMA are given. The results show that the beam directivity, the beam broadening, and the side-lobe level requirements were met. It is demonstrated that the improved PMA was effective and feasible for SAR application.
基金the National Basic Research Program (973 Program) (2002CB312200)
文摘Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-level scheduling and project decomposition technology, and the genetic algorithm and tabu search is combined. Topological reordering technology is used to improve the efficiency of evaluation. Simulation results show the proposed algorithm can obtain satisfied scheduling results in acceptable time.
文摘This paper introduces a hybrid evolutionary algorithm for the resource-constrained project scheduling problem (RCPSP). Given an RCPSP instance, the algorithm identifies the problem structure and selects a suitable decoding scheme. Then a multi-pass biased sampling method followed up by a multi-local search is used to generate a diverse and good quality initial population. The population then evolves through modified order-based recombination and mutation operators to perform exploration for promising solutions within the entire region. Mutation is performed only if the current population has converged or the produced offspring by recombination operator is too similar to one of his parents. Finally the algorithm performs an intensified local search on the best solution found in the evolutionary stage. Computational experiments using standard instances indicate that the proposed algorithm works well in both computational time and solution quality.
基金supported by the National Natural Science Foundation of China(71171038)
文摘A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.
文摘The investment decision making of Project Gang, the projects that are associated with one another on economy and technique, is studied. In order to find out the best Scheme that can make the maximum profit, a dynamic programming algorithm on the investment decision making of Project Gang is brought forward, and this algorithm can find out the best Scheme of distributing the m resources to the n Items in the time of O(m 2 n).
