On the Differential Properties of Temlyakov-Type and Temlyakov-Bavrin-Type Integrals

We establish a formula that expresses the value of the density of the Temlyakov-type integral with defining domain of type A in terms of the integral itself by means of a differential operator. We extend this operator connection to the Temlyakov–Bavrin-type integral of order k. Our study bases on the method of linear differential operators with variable coefficients which is developed by A. V. Nelaev.     

On Potentially Abelian Geometric Representations

The finiteness is proved of the set of isomorphism classes of potentially abelian geometric Galois representations with a given set of data. This is a special case of the finiteness conjecture of Fontaine and Mazur.     

Prefiltration technique via aggregation for constructing low‐density high‐quality factorized sparse approximate inverse preconditionings

This paper considers a new approach to a priori sparsification of the sparsity pattern of the factorized approximate inverses (FSAI) preconditioner using the so‐called vector aggregation technique. The suggested approach consists in construction of the FSAI preconditioner to the aggregated matrix with a prescribed sparsity pattern. Then small entries of the computed ‘aggregated’ FSAI preconditioning matrix are dropped, and the resulting pointwise sparsity pattern is used to construct the low‐density block sparsity pattern of the FSAI preconditioning matrix to the original matrix. This approach allows to minimize (sometimes significantly) the construction costs of low‐density high‐quality FSAI preconditioners. Numerical results with sample matrices from structural mechanics and thin shell problems are presented. Copyright © 2002 John Wiley & Sons, Ltd.     

Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept

In this paper, the problem of finding a shortest path tree rooted at a given source node on a directed graph (SPT) is considered. A new efficient algorithm based on a primal-dual approach is presented, which improves both the convergence and the complexity of the best known auction-like algorithm. It uses the virtual source (VS) concept based on the following consideration: when a node i is visited for the first time by any algorithm which preserves verified the dual admissibility conditions, then the shortest path (SP) from the source node to i is found. Therefore, the SP from the source to the remaining nodes may be computed by considering i as a virtual source.We propose a very efficient implementation of an auction-like algorithm that uses this concept and enables us to obtain a computational cost of O(n ²), where n is the number of nodes.Numerical experimentsare reported showing that the new method outdoes previously proposed auction-like algorithms and is highly competitive with other state-of-art SP approaches.     

Nonlinear Filtering for Diffusions in Random Environments

Suppose that the signal X to be estimated is a diffusion process in a random medium W and the signal is correlated with the observation noise. We study the historical filtering problem concerned with estimating the signal path up until the current time based upon the back observations. Using Dirichlet form theory, we introduce a filtering model for general rough signal X ^W and establish a multiple Wiener integrals representation for the unnormalized pathspace filtering process. Then, we construct a precise nonlinear filtering model for the process X itself and give the corresponding Wiener chaos decomposition.     

REPRESENTATIONS OF THE TWO PARAMETER DEFORMATION OF THE VIRASORO ALGEBRA

This paper constructs a class of Harish-Chandra modules with multiplicity ≤1 of the two parameter deformation of Virasoro algebra and proves a classification theorem.     

Classification of graded Hecke algebras for complex reflection groups

The graded Hecke algebra for a finite Weyl group is intimately related to the geometry of the Springer correspondence. A construction of Drinfeld produces an analogue of a graded Hecke algebra for any finite subgroup of GL(V). This paper classifies all the algebras obtained by applying Drinfeld's construction to complex reflection groups. By giving explicit (though nontrivial) isomorphisms, we show that the graded Hecke algebras for finite real reflection groups constructed by Lusztig are all isomorphic to algebras obtained by Drinfeld's construction. The classification shows that there exist algebras obtained from Drinfeld's construction which are not graded Hecke algebras as defined by Lusztig for real as well as complex reflection groups. Received: July 25, 2001     

微光光子数字化摄象机

美国自适应光学联合公司(AOA)在哈佛大学 PAPA 探测器的基础上研制成功的光子数字化编址摄象机是一种具有极高探测灵敏度的光子计数式二维微光摄象机。采用多通道光学编码方法,可对光电倍增管探测到的每一个光电于事件产生相应的(x,y,T)时-空坐标数据,微机采集来自光子摄象机的数据流供实时图象显示和处理。     

分析非轴对称腔的复光线数值迭代法

将像散光束的复光线表示法用于分析非轴对称腔，并对有复杂像散的折迭腔作了数值迭代计算以说明方法的应用．