Aggregate error locator and error value computation in AG codes

The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code.     

The Iyengar Type Inequalities with Exact Estimations and the Chebyshev Central Algorithms of Integrals

In this paper, both low order and high order extensions of the Iyengar type inequality are obtained. Such extensions are the best possible in the same sense as that of the Iyengar inequality. hzrthermore, the Chebyshev central algorithms of integrals for some function classes and some related problems are also considered and investigated.     

Reply to “Comment on papers by K. Shanahan that propose to explain anomalous heat generated by cold fusion”, E. Storms, Thermochim. Acta, 2006

Dr. E. Storms has published a Letter [E. Storms, Comment on papers by K. Shanahan that propose to explain anomalous heat generated by cold fusion, Thermochim. Acta, 2006] in which he argues that in a sequence of recent papers, the apparent excess heat signal claimed by Dr. Shanahan to arise from a calibration constant shift is actually true excess heat. In particular he proposes that the mechanisms proposed that foster the proposed calibration constant shifts cannot occur as postulated for several reasons. As well, he proposes Shanahan has ignored the extant data proving this. Because this Letter may lend unwarranted support to acceptance of cold fusion claims, these erroneous arguments used by Storms need to be answered.     

基于二次插值的非饱和土壤水流问题的特征差分方法及数值模拟

本文针对一类非饱和土壤水流问题,提出了基于二次插值的特征差分格式,得到了严谨的L2模误差估计.并作了数值试验,指明方法的有效性.     

Error estimation,adaptivity and data transfer in enriched plasticity continua to analysis of shear band localization

In this paper, an adaptive FE analysis is presented based on error estimation, adaptive mesh refinement and data transfer for enriched plasticity continua in the modelling of strain localization. As the classical continuum models suffer from pathological mesh-dependence in the strain softening models, the governing equations are regularized by adding rotational degrees-of-freedom to the conventional degrees-of-freedom. Adaptive strategy using element elongation is applied to compute the distribution of required element size using the estimated error distribution. Once a new mesh is generated, state variables and history-dependent variables are mapped from the old finite element mesh to the new one. In order to transfer the history-dependent variables from the old to new mesh, the values of internal variables available at Gauss point are first projected at nodes of old mesh, then the values of the old nodes are transferred to the nodes of new mesh and finally, the values at Gauss points of new elements are determined with respect to nodal values of the new mesh. Finally, the efficiency of the proposed model and computational algorithms is demonstrated by several numerical examples.     

Fourier regularization for a backward heat equation

In this paper a simple and convenient new regularization method for solving backward heat equation—Fourier regularization method is given. Meanwhile, some quite sharp error estimates between the approximate solution and exact solution are provided. A numerical example also shows that the method works effectively.     

Empirical minimization

We investigate the behavior of the empirical minimization algorithm using various methods. We first analyze it by comparing the empirical, random, structure and the original one on the class, either in an additive sense, via the uniform law of large numbers, or in a multiplicative sense, using isomorphic coordinate projections. We then show that a direct analysis of the empirical minimization algorithm yields a significantly better bound, and that the estimates we obtain are essentially sharp. The method of proof we use is based on Talagrand's concentration inequality for empirical processes. Research partially supported by NSF under award DMS-0434393. Research partially supported by the Australian Research Council Discovery Porject DP0343616.     

On the complexity of suboptimal decoding for list and decision feedback schemes

We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2^nR(1-R). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2^nR(1-C), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent.     

拟协调元的精度分析

利用双参数有限元的框架，证明利用拟协调元方法构造的非协调三角形板元都具有一个非常特殊的性质。即相容误差比插值误差高一阶。这是常规有限元和一般非协调元所不具备的。     

灰色Verhulst模型的样条插值函数的残差修正

本用样条函数对灰色Verhulst模型的残差序列进行插值拟合，然后作用于二阶线性微分方程，并以此修正原模型，得到一种新的预测模型的数值解，提高了拟合的精确度。