应用不等权重支持向量机预测人民币汇率的变动

基于金融时间序列的近期数据对未来的影响会大于早期数据,对应用于金融时间序列预测的支持向量机方法进行改进,给出了不等权重支持向量机方法（USVM）及其多项式光滑化处理。将不等权重支持向量机方法应用于训练样本集的子集确定预测模型,实证分析表明USVM算法预测是有效的。     

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable

A fully odd K₄ is a subdivision of K₄ such that each of the six edges of the K₄ is subdivided into a path of odd length. In 1974, Toft conjectured that every graph containing no fully odd K₄ can be vertex-colored with three colors. The purpose of this paper is to prove Toft's conjecture.     

Landau多项式算子与无界函数逼近

利用扩展乘数法构造了 Landau型多项式算子逼近全空间或有界集上无界函数的若干收敛定理 ,给出了具有一般性的结论 ,从而推广了已有文献的若干结果 .     

NONPARAMETRIC AUTOCOVARIANCE FUNCTION ESTIMATION

Nonparametric estimators of autocovariance functions for non-stationary time series are developed. The estimators are based on straightforward nonparametric mean function estimation ideas and allow use of any linear smoother (e.g. smoothing spline, local polynomial). The paper studies the properties of the estimators, and illustrates their usefulness through application to some meteorological and seismic time series.     

A Construction of Lancaster Probabilities with Margins in the Multidimensional Meixner Class

The well-known Meixner class (Meixner, 1934) of probabilities on R has been extended recently to R ^d (Pommeret, 1996). This generalized Meixner class corresponds to the simple quadratic natural exponential families characterized by Casalis (1996). Following Lancaster (1975), the present paper offers a characterization of the joint probability of a randomvector ( X, Y ) such that the two variables X and Y on R ^d belong to the multidimensional Meixner class and fulfil a bi-orthogonality condition involving orthogonal polynomials. The joint probabilities, called Lancaster probabilities, are characterized by two sequences of orthogonal polynomials with respect to the margins and a sequence of expectations of products. Some multivariate probabilities are studied, namely the Poisson-Gaussian and the gamma-Gaussian.     

On Tiku's robust procedure — a Bayesian insight

Tiku's robust procedure for testing mean and variance from nonnormal universe is examined from the Bayesian viewpoint. The posterior distribution of the scale parameter is derived and then approximated by a Laguerre polynomial expansion while the posterior distribution of the location parameter is approximated by a linear combination of t-distributions. For the example with Darwin's data, the approximations appear to be extremely good.     

Convergence of Heavy-tailed Monte Carlo Markov Chain Algorithms

Abstract.  In this paper, we use recent results of Jarner & Roberts ( Ann. Appl. Probab., 12, 2002, 224) to show polynomial convergence rates of Monte Carlo Markov Chain algorithms with polynomial target distributions, in particular random-walk Metropolis algorithms, Langevin algorithms and independence samplers. We also use similar methodology to consider polynomial convergence of the Gibbs sampler on a constrained state space. The main result for the random-walk Metropolis algorithm is that heavy-tailed proposal distributions lead to higher rates of convergence and thus to qualitatively better algorithms as measured, for instance, by the existence of central limit theorems for higher moments. Thus, the paper gives for the first time a theoretical justification for the common belief that heavy-tailed proposal distributions improve convergence in the context of random-walk Metropolis algorithms. Similar results are shown to hold for Langevin algorithms and the independence sampler, while results for the mixing of Gibbs samplers on uniform distributions on constrained spaces are rather different in character.     

二阶电路完全响应的计算机辅助教学研究

本文从理论上研究了二阶电路完全响应的检测理论，讨论了用MCS－51单片机控制的二阶电路辅助教学系统的设计思想以及MCS－51单片机辅助教学系统的实现方案。     

寻找有理根的新方法

提出了用矩阵讨论多项式的有理根 ,用列表法一次性求出有理根 .     

Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows

One of the most notorious network design problems is the Quadratic Assignment Problem (QAP). We develop an heuristic algorithm for QAPs along with an M/G/C/C state dependent queueing model for capturing congestion in the traffic system interconnecting the nodes in the network. Computational results are also presented.