Wavelets and adaptive grids for the discontinuous Galerkin method

In this paper, space adaptivity is introduced to control the error in the numerical solution of hyperbolic systems of conservation laws. The reference numerical scheme is a new version of the discontinuous Galerkin method, which uses an implicit diffusive term in the direction of the streamlines, for stability purposes. The decision whether to refine or to unrefine the grid in a certain location is taken according to the magnitude of wavelet coefficients, which are indicators of local smoothness of the numerical solution. Numerical solutions of the nonlinear Euler equations illustrate the efficiency of the method.     

混合位级正交试验设计的极差分析方法

本文指出，在混合位级的正交试验设计中，以往的极差分析方法存在着不足。本文给出了极差的修正方法，并用大量实例做了数值验证，说明这个修正确实很有效     

Pseudo-Strong Regularity Around a Set

A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ.     

On the chromatic polynomial of a graph

Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()^α≤≤ () ^{n −ω}. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour number μ(G) of G: n− (n−ω)() ^{n −ω}≤μ(G)≤n−α() ^α. Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002     

ON THE GENERALIZATIONS OF KALANDIA＇S LEMMA

Based on Bernstein＇s Theorem, Kalandia＇s Lemma describes the error estimate and the smoothness of the remainder under the second part of Hoelder norm when a HSlder function is approximated by its best polynomial approximation. In this paper, Kalandia＇s Lemma is generalized to the cases that the best polynomial is replaced by one of its four kinds of Chebyshev polynomial expansions, the error estimates of the remainder are given out under Hoeder norm or the weighted HSlder norms.     

The Lascoux, Leclerc and Thibon algorithm and Soergel's tilting algorithm

We generalize Soergel's tilting algorithm to singular weights and deduce from this the validity of the Lascoux-Leclerc-Thibon conjecture on the connection between the canonical basis of the basic submodule of the Fock module and the representation theory of the Hecke-algebras at root of unity. Supported in part by Programa Reticulados y Ecuaciones and by FONDECYT grant 1051024.     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.     

On interpolatory divergence-free wavelets

We construct interpolating divergence-free multiwavelets based on cubic Hermite splines. We give characterizations of the relevant function spaces and indicate their use for analyzing experimental data of incompressible flow fields. We also show that the standard interpolatory wavelets, based on the Deslauriers-Dubuc interpolatory scheme or on interpolatory splines, cannot be used to construct compactly supported divergence-free interpolatory wavelets.

     

一种利用Gabor小波特征的目标跟踪方法

小波特征跟踪是一种新的目标跟踪方法。这种方法利用Gabor小波提取目标的边界特征来组成特征模板,并由小波滤波器系数组成特征向量。在跟踪过程中不断优化特征模板的旋转、尺度及平移等几何变形参数,使得小波特征向量值在最小平方和的意义上与初始值相匹配,从而实现目标旋转、尺度及平移等几何变形时的自动跟踪。实验表明,该方法能够有效地跟踪飞机、车辆等目标,并且能够抵抗全局亮度的变化和局部遮挡的干扰。