It is important for executives to predict the future trends. Otherwise, their companies cannot make profitable decisions and investments. The Bass diffusion model can describe the empirical adoption curve for new prod...
详细信息
It is important for executives to predict the future trends. Otherwise, their companies cannot make profitable decisions and investments. The Bass diffusion model can describe the empirical adoption curve for new products and technological innovations. The Grey model provides short-term forecasts using four data points. This study develops a combined model based on the rolling Grey model (RGM) and the Bass diffusion model to forecast motherboard shipments. In addition, we investigate evolutionary optimization algorithms to determine the optimal parameters. Our results indicate that the combined model using a hybrid algorithm outperforms other methods for the fitting and forecasting processes in terms of mean absolute percentage error.
A novel algorithm, called variable weight fuzzy marginal linearization (VWFML) method, is proposed. This method can supply approximate analytic and numerical solutions to Lane-Emden equations. And it is easy to be imp...
详细信息
A novel algorithm, called variable weight fuzzy marginal linearization (VWFML) method, is proposed. This method can supply approximate analytic and numerical solutions to Lane-Emden equations. And it is easy to be implemented and extended for solving other nonlinear differential equations. Numerical examples are included to demonstrate the validity and applicability of the developed technique.
A numerical study of optimal low-thrust limited power trajectories for simple transfer (no rendezvous) between circular coplanar orbits in an inverse-square force field is performed by two different classes of algorit...
详细信息
A numerical study of optimal low-thrust limited power trajectories for simple transfer (no rendezvous) between circular coplanar orbits in an inverse-square force field is performed by two different classes of algorithms in optimization of trajectories. This study is carried out by means of a direct method based on gradient techniques and by an indirect method based on the second variation theory. The direct approach of the trajectory optimization problem combines the main positive characteristics of two well-known direct methods in optimization of trajectories: the steepest-descent (first-order gradient) method and a direct second variation (second-order gradient) method. On the other hand, the indirect approach of the trajectory optimization problem involves two different algorithms of the well-known neighboring extremals method. Several radius ratios and transfer durations are considered, and the fuel consumption is taken as the performance criterion. For small-amplitude transfers, the results are compared to the ones provided by a linear analytical theory.
Multiplicative noise, also known as speckle noise, is signal dependent and difficult to remove. Based on a fourth-order PDE model, this paper proposes a novel approach to remove the multiplicative noise on images. In ...
详细信息
Multiplicative noise, also known as speckle noise, is signal dependent and difficult to remove. Based on a fourth-order PDE model, this paper proposes a novel approach to remove the multiplicative noise on images. In practice, Fourier transform and logarithm strategy are utilized on the noisy image to convert the convolutional noise into additive noise, so that the noise can be removed by using the traditional additive noise removal algorithm in frequency domain. For noise removal, a new fourth-order PDE model is developed, which avoids the blocky effects produced by second-order PDE model and attains better edge-preserve ability. The performance of the proposed method has been evaluated on the images with both additive and multiplicative noise. Compared with some traditional methods, experimental results show that the proposed method obtains superior performance on different PSNR values and visual quality.
Having already carried on on-line examination under the network environment several years of history, regardless which kind examines it is,the problems is divided into objective and subjective. It have been very matur...
详细信息
ISBN:
(纸本)9783037853771
Having already carried on on-line examination under the network environment several years of history, regardless which kind examines it is,the problems is divided into objective and subjective. It have been very mature to Automatically grade examination papers in the objective by database technique For automatic checking over subjective examination, its procedure involves some restriction theory and technique development,such as artificial intelligence, natural language comprehension and mode identification etc., So far, there is no accepted *** paper put forward to the research direction of the algorithm in automatic checking over subjective examination by analyzing the present condition for grading examination papers.
Self-organizing map (SOM) neural networks have been widely applied in information sciences. In particular, Su and Zhao proposes in (2009) an SOM-based optimization (SOMO) algorithm in order to find a wining neuron, th...
详细信息
Self-organizing map (SOM) neural networks have been widely applied in information sciences. In particular, Su and Zhao proposes in (2009) an SOM-based optimization (SOMO) algorithm in order to find a wining neuron, through a competitive learning process, that stands for the minimum of an objective function. In this paper, we generalize the SOM-based optimization (SOMO) algorithm to so-called SOMO-m algorithm with m winning neurons. Numerical experiments show that, for m > 1, SOMO-m algorithm converges faster than SOM-based optimization (SOMO) algorithm when used for finding the minimum of functions. More importantly, SOMO-m algorithm with m >= 2 can be used to find two or more minimums simultaneously in a single learning iteration process, while the original SOM-based optimization (SOMO) algorithm has to fulfil the same task much less efficiently by restarting the learning iteration process twice or more times.
We develop an optimization model for risk management in a virtual enterprise environment based on a novel multiswarm particle swarm optimizer called (PSO)-O-2. The main idea of (PSO)-O-2 is to extend the single popula...
详细信息
We develop an optimization model for risk management in a virtual enterprise environment based on a novel multiswarm particle swarm optimizer called (PSO)-O-2. The main idea of (PSO)-O-2 is to extend the single population PSO to the interacting multiswarms model by constructing hierarchical interaction topology and enhanced dynamical update equations. With the hierarchical interaction topology, a suitable diversity in the whole population can be maintained. At the same time, the enhanced dynamical update rule significantly speeds up the multiswarm to converge to the global optimum. With five mathematical benchmark functions, (PSO)-O-2 is proved to have considerable potential for solving complex optimization problems. (PSO)-O-2 is then applied to risk management in a virtual enterprise environment. Simulation results demonstrate that the (PSO)-O-2 algorithm is more feasible and efficient than the PSO algorithm in solving this real-world problem.
This paper presents a 2D convergence density criterion for minimizing the total junction delay at isolated junctions in the lane-based optimization framework. The lane-based method integrates the design of lane markin...
详细信息
This paper presents a 2D convergence density criterion for minimizing the total junction delay at isolated junctions in the lane-based optimization framework. The lane-based method integrates the design of lane markings and signal settings for traffic movements in a unified framework. The problem of delay minimization is formulated as a Binary Mix Integer Non Linear Program (BMINLP). A cutting plane algorithm can be applied to solve this difficult BMINLP problem by adding hyperplanes sequentially until sufficient numbers of planes are created in the form of solution constraints to replicate the original nonlinear surface in the solution space. A set of constraints is set up to ensure the feasibility and safety of the resultant optimized lane markings and signal settings. The main difficulty to solve this high-dimension nonlinear nonconvex delay minimization problem using cutting plane algorithm is the requirement of substantial computational efforts to reach a good-quality solution while approximating the nonlinear solution space. A new stopping criterion is proposed by monitoring a 2D convergence density to obtain a converged solution. A numerical example is given to demonstrate the effectiveness of the proposed methodology. The cutting-plane algorithm producing an effective signal design will become more computationally attractive with adopting the proposed stopping criterion.
A new method for approximate analytic series solution called multistep Laplace Adomian Decomposition Method (MLADM) has been proposed for solving the model for HIV infection of CD4(+) T cells. The proposed method is m...
详细信息
A new method for approximate analytic series solution called multistep Laplace Adomian Decomposition Method (MLADM) has been proposed for solving the model for HIV infection of CD4(+) T cells. The proposed method is modification of the classical Laplace Adomian Decomposition Method (LADM) with multistep approach. Fourth-order Runge-Kutta method (RK4) is used to evaluate the effectiveness of the proposed algorithm. When we do not know the exact solution of a given problem, generally we use the RK4 method for comparison since it is widely used and accepted. Comparison of the results with RK4 method is confirmed that MLADM performs with very high accuracy. Results show that MLADM is a very promising method for obtaining approximate solutions to the model for HIV infection of CD4(+) T cells. Some plots and tables are presented to show the reliability and simplicity of the methods. All computations have been made with the aid of a computer code written in Mathematica 7.
暂无评论