Torsion simple modules over the quantum spatial ageing algebra

Various classes of simple torsion modules are classified over the quantum spatial ageing algebra (this is a Noetherian algebra of Gelfand-Kirillov dimension 4). Explicit constructions of these modules are given and for each module its annihilator is found.     

Relative Energy Shift of a Two-Level Atom in a Cylindrical Spacetime

We investigate the evolution dynamics of a two-level atom system interacting with the massless scalar field in a Cylindrical spacetime. We find that both the energy shifts of ground state and excited state can be separated into two parts due to the vacuum fluctuations. One is the corresponding energy shift for a rest atom in four-dimensional Minkowski space without spatial compactification, the other is just the modification of the spatial compactified periodic length. It will reveal that the influence of the presence of one spatial compactified dimension can not be neglected in Lamb shift as the relative energy level shift of an atom.     

LAND USE OPTIMIZATION USING SELF-ORGANIZING ALGORITHMS

ABSTRACT. In many spatial systems the interaction between various regions decreases dramatically with distance. This suggests that local trade-offs may be more important than global ones in land use planning and that a decentralized, parallel optimization of the individual regions may be an attractive supplement to more centralized optimization approaches. In this paper, we solve a forest planning problem using a series of decentralized approaches. The approaches can be characterized as self-organizing algorithms and are modeled in the framework of a cellular automaton. We compare our results with those obtained by more centralized approaches, viz. a large sample approach, simulated annealing, and a genetic algorithm. We find that the self-organizing algorithms generally converge much faster to solutions which are at least as good as those obtained by simulated annealing and the genetic algorithm.     

How to make a triangulation of polytopal

We introduce a numerical isomorphism invariant for any triangulation of . Although its definition is purely topological (inspired by the bridge number of knots), reflects the geometric properties of . Specifically, if is polytopal or shellable, then is ``small' in the sense that we obtain a linear upper bound for in the number of tetrahedra of . Conversely, if is ``small', then is ``almost' polytopal, since we show how to transform into a polytopal triangulation by local subdivisions. The minimal number of local subdivisions needed to transform into a polytopal triangulation is at least . Using our previous results [The size of triangulations supporting a given link, Geometry & Topology 5 (2001), 369-398], we obtain a general upper bound for exponential in . We prove here by explicit constructions that there is no general subexponential upper bound for in . Thus, we obtain triangulations that are ``very far' from being polytopal. Our results yield a recognition algorithm for that is conceptually simpler, although somewhat slower, than the famous Rubinstein-Thompson algorithm.

     

Spatial‐temporal basic reproduction number and dynamics for a dengue disease diffusion model

A reaction‐diffusion system with free boundary is proposed to describe the transmission of the dengue disease from mosquitoes to humans. In addition to the classical basic reproduction number R₀, the spatial‐temporal basic reproduction number is introduced to determine the persistence and eradication of the disease. Some sufficient conditions for the disease vanishing or spreading are obtained. The disease will go extinct under one of the conditions: the classical basic reproduction number R₀ < 1 and the spatial‐temporal basic reproduction number with small expanding capability. The spread of the disease in the whole area is possible if for some t≥0. Numerical simulations are also given to illustrate the theoretical results.     

Respectively scaled HSS iteration methods for solving discretized spatial fractional diffusion equations

For the discrete linear systems resulted from the discretization of the one‐dimensional anisotropic spatial fractional diffusion equations of variable coefficients with the shifted finite‐difference formulas of the Grünwald–Letnikov type, we propose a class of respectively scaled Hermitian and skew‐Hermitian splitting iteration method and establish its asymptotic convergence theory. The corresponding induced matrix splitting preconditioner, through further replacements of the involved Toeplitz matrices with certain circulant matrices, leads to an economic variant that can be executed by fast Fourier transforms. Both theoretical analysis and numerical implementations show that this fast respectively scaled Hermitian and skew‐Hermitian splitting preconditioner can significantly improve the computational efficiency of the Krylov subspace iteration methods employed as effective linear solvers for the target discrete linear systems.     

基于无线Mesh网络的一种信道分配算法及路由协议

提出了在多信道环境下的无线Mesh网络中的一种混合型路由协议TOIRP(tree-based and on-de-mand integrated routing protocol)以及一种分布式的信道分配算法CLBCA(channel load based channel assign-ment).TOIRP协议采用HWMP(hybrid wireless mesh protocol)所提出的混合路由技术,将基于树的路由与传统的AODV(ad hoc on-demand distance vector)路由相结合,减少路由发现的时延,同时采用了一种新的路由判据CETTI(cumulative expected transmission time with interference).该路由判据充分考虑多信道的特性,设计了一种量化通信干扰的方法,将干扰分为外部数据流对路径的干扰以及路径内部数据流的干扰两个方面,并综合考虑了跳数、时延等因素,提高了网络的吞吐量.信道分配算法分为收发器与邻居节点绑定和收发器与信道绑定两个部分,将信道的负载作为选择信道的标准,避免了多信道中常见的信道依赖所造成的影响,并且提高了信道的利用率.模拟结果表明,采用新的路由判据后,网络的吞吐量最优情况下得到提升.     

东南部欠发达地区县域城乡空间统筹发展的规划思考

随着国内区域经济联动的加强,产业布局的调整升级,以及大区域交通条件的改善,我国城市化经济已经进入了一个＂全球化-区域化＂的新发展时期.东南部欠发达地区的城市化、工业化发展面临着若干重大机遇.通过分析县域城乡空间发展存在的一般性问题和制约因素,提出：东南部欠发达地区的发展应以空间规划作为切入点,通过空间规划与行动集成,将城乡统筹概念落实到县域空间层面上,构建一个综合的发展战略与行动规划.     

A primer on perfect simulation for spatial point processes

This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 2002