Springer basic sets and modular Springer correspondence for classical types

We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic $p$, and with coefficients in a field of odd characteristic $?\ne p$): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols.     

On generalized perfect difference sets constructed from Sidon sets

Let $\mathbb{N}$ be the set of positive integers. For a nonempty set A of integers and every integer u, denote by $d_A(u)$ the number of $(a,a^{\prime })$ with $a,a^{\prime }\in A$ such that $u=a-a^{\prime }$. For a sequence S of positive integers, let $S(x)$ be the counting function of S. The set $A\subseteq \mathbb{N}$ is called a perfect difference set if $d_A(u)=1$ for every positive integer u. In 2008, Cilleruelo and Nathanson (2008) [4] constructed dense perfect difference sets from dense Sidon sets. In this paper, as a main result, we prove that: let $f:\mathbb{N}\to \mathbb{N}$ be an increasing function satisfying $f(n)\ge 2$ for any positive integer n, then for every Sidon set B and every function $\omega (x)\to \infty$, there exists a set $A\subseteq \mathbb{N}$ such that $d_A(u)=f(u)$ for every positive integer u and $B(x/3)-\omega (x)\le A(x)\le B(x/3)+\omega (x)$ for all $x\ge C_{f,B,\omega }$.     

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.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

EXISTENCE OF PERIODIC SOLUTIONS OF SYSTEM OF DIFFERENCE EQUATIONS

This paper studies the nonautonomous nonlinear system of difference equationsΔx(n)=A(n)x(n)+f(n,x(n)),n∈Z,(*) where x(n)∈R~N,A(n)=(a_(ij)(n))N×N is an N×N matrix,with a-(ij)∈C(R,R) for i,j= 1,2,3,...,N,and f=(f_1,f_2,...,f_N)~T∈C(R×R~N,R~N),satisfying A(t+ω)=A(t),f(t+ω,z)=f(t,z) for any t∈R,(t,z)∈R×R~N andωis a positive integer.Sufficient conditions for the existence ofω-periodic solutions to equations (*) are obtained.     

一类非线性Schr(o)dinger方程的守恒差分法与Fourier谱方法

考察了一类带导数项的非线性Schrodinger方程的周期边值问题，提出了一种守恒的差分格式，在空间方向上采用Fourier谱方法，证明了格式的稳定性和收敛性．数值试验得到了与理论分析一致的结果．     

AGE method simulations of a turbulent far‐wake compared to spectral DNS

Turbulent flow simulation methods based on finite differences are attractive for their simplicity, flexibility and efficiency, but not always for accuracy or stability. This paper demonstrates that a good compromise is possible with the advected grid explicit (AGE) method. Starting from the same initial field as a previous spectral DNS, AGE method simulations of a planar turbulent wake were carried out as DNS, and then at three levels of reduced resolution. The latter cases were in a sense large‐eddy simulations (LES), although no specific sub‐grid‐scale model was used. Results for the two DNS methods, including variances and power spectra, were very similar, but the AGE simulation required much less computational effort. Small‐scale information was lost in the reduced resolution runs, but large‐scale mean and instantaneous properties were reproduced quite well, with further large reductions in computational effort. Quality of results becomes more sensitive to the value chosen for one of the AGE method parameters as resolution is reduced, from which it is inferred that the numerical stability procedure controlled by the parameter is acting in part as a sub‐grid‐scale model. Copyright © 2002 John Wiley & Sons, Ltd.     

红外热像仪参数的双黑体测量装置

对红外热像仪参数双黑体测量装置的工作原理进行了介绍。装置采用双黑体及反射型靶标为温差辐射源，可实现黑体温度温差准直辐射的定期校准和红外热像仪参数测量量值的溯源，也可实现红外热像仪参数的可控性，以及对它进行稳定的、可复现的精确测量。推导出利用红外热像仪参数双黑体测量装置测量信号传递函数SiTF数学模型，分析了红外热像仪参数测量装置的客观因素——仪器常数，针对仪器常数对SiTF测量的影响进行了试验。试验结果表明，仪器常数对红外热像仪SiTF参数测量精度影响较大，并同时影响时域与空域NETD及3D噪声的准确测量。     

迈克尔逊干涉仪中补偿板与干涉条纹

通过分析缺失补偿板的迈克尔逊干涉仪中的附加光程差,推出干涉条纹满足的方程式,并用计算机模拟了动镜移动过程中变化的干涉条纹,与实验结果相一致.