In this paper a new .mnultidimensional time series forecasting scheme based on the empirical orthogonal function (EOF) stepwise iteration process is introduced. The scheme is tested in a series of forecast experiments...In this paper a new .mnultidimensional time series forecasting scheme based on the empirical orthogonal function (EOF) stepwise iteration process is introduced. The scheme is tested in a series of forecast experiments of Nino3 SST anomalies and Tahiti-Darwin SO index. The results show that the scheme is feasible and ENSO predictable.展开更多
In this paper, a class of smoothing modulus-based iterative method was presented for solving implicit complementarity problems. The main idea was to transform the implicit complementarity problem into an equivalent im...In this paper, a class of smoothing modulus-based iterative method was presented for solving implicit complementarity problems. The main idea was to transform the implicit complementarity problem into an equivalent implicit fixed-point equation, then introduces a smoothing function to obtain its approximation solutions. The convergence analysis of the algorithm was given, and the efficiency of the algorithms was verified by numerical experiments.展开更多
In this paper, we propose a Fast Iteration Method for solving mixture regression problem, which can be treated as a model-based clustering. Compared to the EM algorithm, the proposed method is faster, more flexible an...In this paper, we propose a Fast Iteration Method for solving mixture regression problem, which can be treated as a model-based clustering. Compared to the EM algorithm, the proposed method is faster, more flexible and can solve mixture regression problem with different error distributions (i.e. Laplace and t distribution). Extensive numeric experiments show that our proposed method has better performance on randomly simulations and real data.展开更多
目的 Linear Programming的simplexmethod建模求最优解。方法应用simplexmethod.结果建立了LinearProgramming的数学模型并用simplexmethod求得了最优解.结论因为单纯形表反映了Linear Programming的所有信息,故用simplexmethod可简便...目的 Linear Programming的simplexmethod建模求最优解。方法应用simplexmethod.结果建立了LinearProgramming的数学模型并用simplexmethod求得了最优解.结论因为单纯形表反映了Linear Programming的所有信息,故用simplexmethod可简便地求得最优解.simplexmethod的基本思路是:先将Linear Programming用sim-plexmethod划为标准型,根据问题的标准型,进行初等行变换,将主元素列除主元素化为1外其余的元素均化为0,当基变量值全为非负时,问题就得到了最优解.展开更多
为解决多基站定位模型中基站之间同步代价高的问题,提出了一种基于多根长馈线天线基站的到达时间差(Time Difference of Arrival,TDOA)定位模型,给出了模型方程和求解方法,该方法将复杂的3对距离差方程组转化为1个一元八次方程,然后采用...为解决多基站定位模型中基站之间同步代价高的问题,提出了一种基于多根长馈线天线基站的到达时间差(Time Difference of Arrival,TDOA)定位模型,给出了模型方程和求解方法,该方法将复杂的3对距离差方程组转化为1个一元八次方程,然后采用Aberth-Newton迭代法来迭代求解方程。通过计算机仿真验证了基于多根长馈线天线基站的TDOA定位模型和解法的有效性,并对该模型的多解问题进行了分析,用优化基站布局的方案,解决了定位模型的唯一解问题。本定位模型在覆盖范围数百米时,定位精度可达分米级。展开更多
文摘In this paper a new .mnultidimensional time series forecasting scheme based on the empirical orthogonal function (EOF) stepwise iteration process is introduced. The scheme is tested in a series of forecast experiments of Nino3 SST anomalies and Tahiti-Darwin SO index. The results show that the scheme is feasible and ENSO predictable.
文摘In this paper, a class of smoothing modulus-based iterative method was presented for solving implicit complementarity problems. The main idea was to transform the implicit complementarity problem into an equivalent implicit fixed-point equation, then introduces a smoothing function to obtain its approximation solutions. The convergence analysis of the algorithm was given, and the efficiency of the algorithms was verified by numerical experiments.
文摘In this paper, we propose a Fast Iteration Method for solving mixture regression problem, which can be treated as a model-based clustering. Compared to the EM algorithm, the proposed method is faster, more flexible and can solve mixture regression problem with different error distributions (i.e. Laplace and t distribution). Extensive numeric experiments show that our proposed method has better performance on randomly simulations and real data.
文摘目的 Linear Programming的simplexmethod建模求最优解。方法应用simplexmethod.结果建立了LinearProgramming的数学模型并用simplexmethod求得了最优解.结论因为单纯形表反映了Linear Programming的所有信息,故用simplexmethod可简便地求得最优解.simplexmethod的基本思路是:先将Linear Programming用sim-plexmethod划为标准型,根据问题的标准型,进行初等行变换,将主元素列除主元素化为1外其余的元素均化为0,当基变量值全为非负时,问题就得到了最优解.
文摘为解决多基站定位模型中基站之间同步代价高的问题,提出了一种基于多根长馈线天线基站的到达时间差(Time Difference of Arrival,TDOA)定位模型,给出了模型方程和求解方法,该方法将复杂的3对距离差方程组转化为1个一元八次方程,然后采用Aberth-Newton迭代法来迭代求解方程。通过计算机仿真验证了基于多根长馈线天线基站的TDOA定位模型和解法的有效性,并对该模型的多解问题进行了分析,用优化基站布局的方案,解决了定位模型的唯一解问题。本定位模型在覆盖范围数百米时,定位精度可达分米级。
