We study how to use the SR1 update to realize minimization methods for problems where the storage is critical. We give an update formula which generates matrices using information from the last m iterations. The numer...We study how to use the SR1 update to realize minimization methods for problems where the storage is critical. We give an update formula which generates matrices using information from the last m iterations. The numerical tests show that the method is efficent.展开更多
In a social system or production line,the restrictions of the cost and the due-time exist in each period.Generally,whether these restrictions are satisfied is dependent not only on the risks of this period,but also on...In a social system or production line,the restrictions of the cost and the due-time exist in each period.Generally,whether these restrictions are satisfied is dependent not only on the risks of this period,but also on the risks generated beforehand.We consider controlling the production process by switching the processing rate to a faster one at a given period.This paper deals with the optimal switching period to minimize the total expected cost of the production process.We first propose the optimal switching period model,and then the mathematic formulation of the total expectation is presented.Finally,the policy of optimal switching period is investigated in detail by numerical experiments.展开更多
New advances within the recently rediscovered field of Compressed Sensing (CS) have opened for a great variety of new possibilities in the field of image reconstruction and more specifically in medical image reconstru...New advances within the recently rediscovered field of Compressed Sensing (CS) have opened for a great variety of new possibilities in the field of image reconstruction and more specifically in medical image reconstruction. In this work, a new approach using a CS-based algorithm is proposed and used in order to solve limited-angle problems (LAPs), like the ones that typically occur in computed tomography or electron microscope. This approach is based on a variant of the Robbins-Monro stochastic approximation procedure, developed by Egaziarian, using regularization by a spatially adaptive filter. This proposal consists on filling the gaps of missing or unobserved data with random noise and enabling a spatially adaptive denoising filter to regularize the data and reveal the underlying topology. This method was tested on different 3D transmission electron microscope datasets that presented different missing data artifacts (e.g, wedge or cone shape). The test results show a great potential for solving LAPs using the proposed technique.展开更多
In this paper we have obtained the existence of weak solutions of the small disturbance equations of steady two-dimension flow [GRAPHICS] with Riemann date [GRAPHICS] where v+ greater-than-or-equal-to 0, v- greater-th...In this paper we have obtained the existence of weak solutions of the small disturbance equations of steady two-dimension flow [GRAPHICS] with Riemann date [GRAPHICS] where v+ greater-than-or-equal-to 0, v- greater-than-or-equal-to 0 and u- less-than-or-equal-to u+ by introducing 'artificial' viscosity terms and employing Helley's theorem. The setting under our consideration is a nonstrictly hyperbolic system. our analysis in this article is quite fundamental.展开更多
The classical limit of the quantum mechanical Kepler problem is derived by using a simple mathematical procedure recently proposed. The method is based both on Bohr’s correspondence principle and the local averages o...The classical limit of the quantum mechanical Kepler problem is derived by using a simple mathematical procedure recently proposed. The method is based both on Bohr’s correspondence principle and the local averages of the quantum probability distribution. We illustrate in a clear fashion the difference between Planck’s limit and Bohr’s correspondence principle. We discuss the confinement effect in macroscopic systems.展开更多
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.展开更多
In order to improve the reconstruction performance for ill-posed emission tomographic problems with limited projections, a generalized interpolation method is proposed in this paper, in which the virtual lines of proj...In order to improve the reconstruction performance for ill-posed emission tomographic problems with limited projections, a generalized interpolation method is proposed in this paper, in which the virtual lines of projection are fabricated from, but not linearly dependent on, the measured projections. The method is called the virtual projection（VP） method.Also, an iterative correction method for the integral lengths is proposed to reduce the error brought about by the virtual lines of projection. The combination of the two methods is called the iterative virtual projection（IVP） method. Based on a scheme of equilateral triangle plane meshes and a six asymmetrically arranged detection system, numerical simulations and experimental verification are conducted. Simulation results obtained by using a non-negative linear least squares method,without any other constraints or regularization, demonstrate that the VP method can gradually reduce the reconstruction error and converges to the desired one by fabricating additional effective projections. When the mean square deviation of normal error superimposed on the simulated measured projections is smaller than 0.03, i.e., the signal-to-noise ratio（SNR）for the measured projections is higher than 30.4, the IVP method can further reduce the reconstruction error reached by the VP method apparently. In addition, as the regularization matrix in the Tikhonov regularization method is updated by an iterative correction process similar to the IVP method presented in this paper, or the Tikhonov regularization method is used in the IVP method, good improvement is achieved.展开更多
The flow shop scheduling problem with limited buffers( LBFSP) widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize total flow time. The algorithm p...The flow shop scheduling problem with limited buffers( LBFSP) widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize total flow time. The algorithm presents a novel discrete improvisation and a differential evolution scheme with the jobpermutation-based representation. Moreover,the discrete harmony search is hybridized with the problem-dependent local search based on insert neighborhood to balance the global exploration and local exploitation. In addition, an orthogonal experiment design is employed to provide a receipt for turning the adjustable parameters of the algorithm. Comparisons based on the Taillard benchmarks indicate the superiority of the proposed algorithm in terms of effectiveness and efficiency.展开更多
Automatic guided vehicles(AGVs)are extensively employed in manufacturing workshops for their high degree of automation and flexibility.This paper investigates a limited AGV scheduling problem(LAGVSP)in matrix manufact...Automatic guided vehicles(AGVs)are extensively employed in manufacturing workshops for their high degree of automation and flexibility.This paper investigates a limited AGV scheduling problem(LAGVSP)in matrix manufacturing workshops with undirected material flow,aiming to minimize both total task delay time and total task completion time.To address this LAGVSP,a mixed-integer linear programming model is built,and a nondominated sorting genetic algorithm II based on dual population co-evolution(NSGA-IIDPC)is proposed.In NSGA-IIDPC,a single population is divided into a common population and an elite population,and they adopt different evolutionary strategies during the evolution process.The dual population co-evolution mechanism is designed to accelerate the convergence of the non-dominated solution set in the population to the Pareto front through information exchange and competition between the two populations.In addition,to enhance the quality of initial population,a minimum cost function strategy based on load balancing is adopted.Multiple local search operators based on ideal point are proposed to find a better local solution.To improve the global exploration ability of the algorithm,a dual population restart mechanism is adopted.Experimental tests and comparisons with other algorithms are conducted to demonstrate the effectiveness of NSGA-IIDPC in solving the LAGVSP.展开更多
文摘We study how to use the SR1 update to realize minimization methods for problems where the storage is critical. We give an update formula which generates matrices using information from the last m iterations. The numerical tests show that the method is efficent.
基金Project partially supported by the Ministry of Education,Science,Sports and Culture,and a Grant-in-Aid for Scientific Research (C),20510130 in 2008,Japan
文摘In a social system or production line,the restrictions of the cost and the due-time exist in each period.Generally,whether these restrictions are satisfied is dependent not only on the risks of this period,but also on the risks generated beforehand.We consider controlling the production process by switching the processing rate to a faster one at a given period.This paper deals with the optimal switching period to minimize the total expected cost of the production process.We first propose the optimal switching period model,and then the mathematic formulation of the total expectation is presented.Finally,the policy of optimal switching period is investigated in detail by numerical experiments.
文摘New advances within the recently rediscovered field of Compressed Sensing (CS) have opened for a great variety of new possibilities in the field of image reconstruction and more specifically in medical image reconstruction. In this work, a new approach using a CS-based algorithm is proposed and used in order to solve limited-angle problems (LAPs), like the ones that typically occur in computed tomography or electron microscope. This approach is based on a variant of the Robbins-Monro stochastic approximation procedure, developed by Egaziarian, using regularization by a spatially adaptive filter. This proposal consists on filling the gaps of missing or unobserved data with random noise and enabling a spatially adaptive denoising filter to regularize the data and reveal the underlying topology. This method was tested on different 3D transmission electron microscope datasets that presented different missing data artifacts (e.g, wedge or cone shape). The test results show a great potential for solving LAPs using the proposed technique.
文摘In this paper we have obtained the existence of weak solutions of the small disturbance equations of steady two-dimension flow [GRAPHICS] with Riemann date [GRAPHICS] where v+ greater-than-or-equal-to 0, v- greater-than-or-equal-to 0 and u- less-than-or-equal-to u+ by introducing 'artificial' viscosity terms and employing Helley's theorem. The setting under our consideration is a nonstrictly hyperbolic system. our analysis in this article is quite fundamental.
文摘The classical limit of the quantum mechanical Kepler problem is derived by using a simple mathematical procedure recently proposed. The method is based both on Bohr’s correspondence principle and the local averages of the quantum probability distribution. We illustrate in a clear fashion the difference between Planck’s limit and Bohr’s correspondence principle. We discuss the confinement effect in macroscopic systems.
基金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.
基金Project supported by the China National Funds for Distinguished Young Scientists of National Natural Science Foundation of China(Grant No.51025622)the National Natural Science Foundation of China(Grant No.51406095)the 100 Top Talents Program of Tsinghua University,Beijing,China(2011)
文摘In order to improve the reconstruction performance for ill-posed emission tomographic problems with limited projections, a generalized interpolation method is proposed in this paper, in which the virtual lines of projection are fabricated from, but not linearly dependent on, the measured projections. The method is called the virtual projection（VP） method.Also, an iterative correction method for the integral lengths is proposed to reduce the error brought about by the virtual lines of projection. The combination of the two methods is called the iterative virtual projection（IVP） method. Based on a scheme of equilateral triangle plane meshes and a six asymmetrically arranged detection system, numerical simulations and experimental verification are conducted. Simulation results obtained by using a non-negative linear least squares method,without any other constraints or regularization, demonstrate that the VP method can gradually reduce the reconstruction error and converges to the desired one by fabricating additional effective projections. When the mean square deviation of normal error superimposed on the simulated measured projections is smaller than 0.03, i.e., the signal-to-noise ratio（SNR）for the measured projections is higher than 30.4, the IVP method can further reduce the reconstruction error reached by the VP method apparently. In addition, as the regularization matrix in the Tikhonov regularization method is updated by an iterative correction process similar to the IVP method presented in this paper, or the Tikhonov regularization method is used in the IVP method, good improvement is achieved.
基金National Natural Science Foundations of China(Nos.61174040,61104178)Shanghai Commission of Science and Technology,China(No.12JC1403400)the Fundamental Research Funds for the Central Universities,China
文摘The flow shop scheduling problem with limited buffers( LBFSP) widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize total flow time. The algorithm presents a novel discrete improvisation and a differential evolution scheme with the jobpermutation-based representation. Moreover,the discrete harmony search is hybridized with the problem-dependent local search based on insert neighborhood to balance the global exploration and local exploitation. In addition, an orthogonal experiment design is employed to provide a receipt for turning the adjustable parameters of the algorithm. Comparisons based on the Taillard benchmarks indicate the superiority of the proposed algorithm in terms of effectiveness and efficiency.
基金supported by the National Natural Science Foundation of China(No.62076095)National Key Research and Development Program(No.2022YFB4602104).
文摘Automatic guided vehicles(AGVs)are extensively employed in manufacturing workshops for their high degree of automation and flexibility.This paper investigates a limited AGV scheduling problem(LAGVSP)in matrix manufacturing workshops with undirected material flow,aiming to minimize both total task delay time and total task completion time.To address this LAGVSP,a mixed-integer linear programming model is built,and a nondominated sorting genetic algorithm II based on dual population co-evolution(NSGA-IIDPC)is proposed.In NSGA-IIDPC,a single population is divided into a common population and an elite population,and they adopt different evolutionary strategies during the evolution process.The dual population co-evolution mechanism is designed to accelerate the convergence of the non-dominated solution set in the population to the Pareto front through information exchange and competition between the two populations.In addition,to enhance the quality of initial population,a minimum cost function strategy based on load balancing is adopted.Multiple local search operators based on ideal point are proposed to find a better local solution.To improve the global exploration ability of the algorithm,a dual population restart mechanism is adopted.Experimental tests and comparisons with other algorithms are conducted to demonstrate the effectiveness of NSGA-IIDPC in solving the LAGVSP.
