Grothendieck groups of unbounded complexes of finitely generated modules

Let Λ be a left Artinian ring, D⁺(mod Λ) (resp., D⁻(mod Λ), D(mod Λ)) the derived category of bounded below complexes (resp., bounded above complexes, unbounded complexes) of finitely generated left Λ-modules. We show that the Grothendieck groups K₀(D⁺(mod Λ)), K₀(D⁻(mod Λ)) and K₀(D(mod Λ)) are trivial. Received: 7 April 2005     

A large deviation principle for 2D stochastic Navier–Stokes equation

In this paper one specifies the ergodic behavior of the 2D-stochastic Navier–Stokes equation by giving a Large Deviation Principle for the occupation measure for large time. It describes the exact rate of exponential convergence. The considered random force is non-degenerate and compatible with the strong Feller property.     

The essential Lagrangian-Grassmannian and the homotopy type of the Fredholm Lagrangian-Grassmannian

Let H be a separable infinite dimensional Hilbert space endowed with a symplectic structure and let L₀⊂H be a Lagrangian subspace. Using the results of [A. Abbondandolo, P. Majer, Infinite dimensional Grassmannians, math.AT/0307192], we show that the Fredholm Lagrangian-Grassmannian FL₀(Λ) has the homotopy type of Gc(L₀), the Grassmannian of all Lagrangian subspaces of H that are compact perturbations of L₀. It is well known that the latter has the homotopy type of the quotient U(∞)/O(∞). As a corollary, we recover a result by B. Booss-Bavnbek and K. Furutani (see [B. Booss-Bavnbek, K. Furutani, Symplectic functional analysis and spectral invariants, Contemp. Math. 242 (1999) 53-83; K. Furutani, Fredholm-Lagrangian-Grassmannian and the Maslov index, J. Geom. Phys. 51 (2004) 269-331]) that the L₀-Maslov index is an isomorphism between the fundamental group of FL₀(Λ) and the integers.     

The Sheffer group and the Riordan group

We define the Sheffer group of all Sheffer-type polynomials and prove the isomorphism between the Sheffer group and the Riordan group. An equivalence of the Riordan array pair and generalized Stirling number pair is also presented. Finally, we discuss a higher dimensional extension of Riordan array pairs.     

A MINI MULTI-GAS DETECTION SYSTEM BASED ON INFRARED PRINCIPLE

To counter the problems of gas accidents in coal mines, family safety resulted from using gas, a new infrared detection system with integration and miniaturization has been developed. The infrared detection optics principle used in developing this system is mainly analyzed. The idea that multi gas detection is introduced and guided through analyzing single gas detection is got across. Through researching the design of cell structure, the cell with integration and miniaturization has been devised. The way of data transmission on Controller Area Network (CAN) bus is explained. By taking Single-Chip Microcomputer (SCM) as intelligence handling, the functional block diagram of gas detection system is designed with its hardware and software system analyzed and devised. This system designed has reached the technology requirement of lower power consumption, mini-volume, big measure range, and able to realize multi-gas detection.     

全气相化学激光体系的直流放电研究

 为了提高化学激光体系(AGIL)中F原子的产率，采用直流放电引发方式，对棒式电极的放电特性进行了研究。在对NF3/He混合气体进行解离时，通过选择不同平衡电阻，得到了3 kW左右的放电注入功率。用光谱分析仪对F原子产率进行了测量。通过拟合计算可得：一个NF3分子能够解离出1.3～1.5个F原子。     

Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001     

Optimality relationships forp-cyclic SOR

Summary The optimality question for blockp-cyclic SOR iterations discussed in Young and Varga is answered under natural conditions on the spectrum of the block Jacobi matrix. In particular, it is shown that repartitioning a blockp-cyclic matrix into a blockq-cyclic form,q, results in asymptotically faster SOR convergence for the same amount of work per iteration. As a consequence block 2-cyclic SOR is optimal under these conditions.Research supported in part by the US Air Force under Grant no. AFOSR-88-0285 and the National Science Foundation under grant no. DMS-85-21154 Present address: Boeing Computer Services, P.O. Box 24346, MS 7L-21, Seattle, WA 98124-0346, USA