Finite element modal solutions of planar photonic crystal fibers with rectangular air-holes

Modal solutions of planar photonic crystal waveguides with rectangular air-holes are presented by using a rigorous full-vectorial finite element-based approach. The effective indices, mode field profiles, spot-sizes, power confinements, modal hybridness, beat lengths and group velocity dispersions are shown for the fundamental and higher order modes of the quasi-TE and TM polarizations.     

关于有界域的逆紧映照

本文对近20年来多复变函数的一个发展迅速的数学热门分支－逆紧映照作了一个回顾和整理。这是作者继续从事此方向研究的先声，也希望本文能为有志于此的研究者提供一些便利。本文从经典的结果开始，通过对逆紧映照在边界上的开拓及分支点的分布的讨论，详细地阐述了这些年来关于逆紧映照何时成为双全纯映照的若干结果。最后，对近年来关于逆紧映照另外的一些工作进行了简单的介绍。     

信号时域积分性质的一个推广应用

对信号进行运算（卷积运算，傅氏变换，拉纸变换）时，应用时域积分性质，得出由函数导数的运算式求取原函数的相应运算结果的一般性计算公式，使时域积分性质的应用得到推广。     

One-dimensional non-nearest-neighbor random walks in the presence of traps

A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site.     

On the distribution of the number of retrials

We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged customer, until he finds an available server.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

热流量计的原理

根据工业及家庭供暖的要求，设计并研制成一种新型的热流量计，它采用方便而新颖的采集信息方式，并使用CPU精确实时的进行控制和运算，保证了热流量计的精确、实时和“分户计量”。     

增强型延迟反馈法控制低维混沌系统的解析研究

基于时间延迟反馈控制混沌系统的方法,提出一种增强型控制方案,并利用分析延迟系统产生Hopf分支条件的方法,给出这种方案控制低维连续自治混沌系统时,在达到控制目标的条件下,控制参数的一般解析关系.将这一方案和分析方法应用到两个混沌模型中,结果表明:采用修正的方案可以明显地改善控制混沌的效果和质量;解析分析的结果与实际数值计算的结果一致. 关键词： 延迟反馈 混沌控制 Hopf分支     

The Hadamard Theorem and Borel–Carathéodory Theorem on Riemann Surfaces

In this paper, we first define a kind of pseudo–distance function and annulus domain on Riemann surfaces, then prove the Hadamard Theorem and the Borel–Carathéodory Theorem on any Riemann surfaces. Supported by NSFC 10501052     

Fast algorithms for determining the linear complexities of sequences over GF(pm) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p ^m) (any positive integer m) with the period 3n (n and p ^m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p ^m) with the period 3n (n and p ^m − 1 are coprime) more efficiently.