Time Asymptotic Behaviour for a One-Velocity Transport Operator with Maxwell Boundary Condition

This paper is concerned with the spectral analysis of a one-velocity transport operator with Maxwell boundary condition in L ₁-space. After a detailed spectral analysis it is shown that the associated Cauchy problem is governed by a C ₀-semigroup. Next, we discuss the irreducibility of the transport semigroup. In particular, we show that the transport semigroup is irreducible. Finally, a spectral decomposition of the solutions into an asymptotic term and a transient one which will be estimated for smooth initial data is given.     

On error bounds for lower semicontinuous functions

We give some sufficient conditions for proper lower semicontinuous functions on metric spaces to have error bounds (with exponents). For a proper convex function f on a normed space X the existence of a local error bound implies that of a global error bound. If in addition X is a Banach space, then error bounds can be characterized by the subdifferential of f. In a reflexive Banach space X, we further obtain several sufficient and necessary conditions for the existence of error bounds in terms of the lower Dini derivative of f. Received: April 27, 2001 / Accepted: November 6, 2001?Published online April 12, 2002     

Asymptotic behaviors of competitive Lotka-Volterra system with stage structure

In this paper, a two-species competitive model with stage structure is presented and studied. Results on the global extinction and permanence are given, which generalize the well-known three theorems for the two species competitive system and, moreover, they confirm the negative effect of stage structure on the permanence of populations as well as estimate the degree of such effect. Conclusions in this paper suggest that for a competitive community stage structure is also one of the important reasons that cause permanence and extinction.     

Learning Markov chains in fractal compression of image data

In a recent paper [17] we proposed a stochastic algorithm which generates optimal probabilities for the decompression of an image represented by the fixed point of an IFS system (SAOP). We show here that such an algorithm is in fact a non trivial example of Generalized Random System with Complete Connections. We also exhibit a generalization which could represent the solution to the inverse problem for an image with grey levels, if a fixed set of contraction maps is available. Received: 1 July 2002     

一类随机环境中的随机游动

在Solomn的模型的基础上对一类随机环境中随机游动进行了讨论，并得出了一个常返性准则和一些极限性质。     

甲基红染料掺杂的聚乙烯醇薄膜光存储特性的实验研究

用2倍频小型YAG激光(532nm)作为写入光和擦除光,用He-Ne激光器623.8nm线作为读出光,用CCD作为探测器,研究了不同写入光功率下,甲基红/聚乙烯醇(MR/PVA)薄膜光栅生长的动力学过程和不同擦除光功率下,光栅擦除的动力学过程.结合光栅生长曲线的波动现象,对光存储机制进行了新的探讨.实验发现,两写入光和读出光的功率配比为1:1:1时,可获得最大衍射效率,提出读出光对写入过程具有双重作用的物理模型,对此实验结果给出了合理的解释.     

A simulated annealing algorithm for resource constrained project scheduling problems

This paper presents a simulated annealing algorithm for resource constrained project scheduling problems with the objective of minimising makespan. In the search algorithm, a solution is represented with a priority list, a vector of numbers each of which denotes the priority of each activity. In the algorithm, a priority scheduling method is used for making a complete schedule from a given priority list (and hence a project schedule is defined by a priority list). The search algorithm is applied to find a priority list which corresponds to a good project schedule. Unlike most of priority scheduling methods, in the suggested algorithm some activities are delayed on purpose so as to extend search space. Solutions can be further improved by delaying certain activities, since non-delay schedules are not dominant in the problem (the set of non-delay schedules does not always include an optimal solution). The suggested algorithm is flexible in that it can be easily applied to problems with an objective function of a general form and/or complex constraints. The performance of the simulated annealing algorithm is compared with existing heuristics on problems prepared by Patterson and randomly generated test problems. Computational results showed that the suggested algorithm outperformed existing ones.