On polynomial symbols for subdivision schemes

Given a dilation matrix A :ℤ^d→ℤ^d, and G a complete set of coset representatives of 2π(A ^−Tℤ^d/ℤ^d), we consider polynomial solutions M to the equation ∑ _g∈G M(ξ+g)=1 with the constraints that M≥0 and M(0)=1. We prove that the full class of such functions can be generated using polynomial convolution kernels. Trigonometric polynomials of this type play an important role as symbols for interpolatory subdivision schemes. For isotropic dilation matrices, we use the method introduced to construct symbols for interpolatory subdivision schemes satisfying Strang–Fix conditions of arbitrary order. Research partially supported by the Danish Technical Science Foundation, Grant No. 9701481, and by the Danish SNF-PDE network.     

On the departure process of a leaky bucket system with long-range dependent input traffic

Due to the strong experimental evidence that the traffic to be offered to future broadband networks will display long-range dependence, it is important to study the possible implications that such traffic may have for the design and performance of these networks. In particular, an important question is whether the offered traffic preserves its long-range dependent nature after passing through a policing mechanism at the interface of the network. One of the proposed solutions for flow control in the context of the emerging ATM standard is the so-called leaky bucket scheme. In this paper we consider a leaky bucket system with long-range dependent input traffic. We adopt the following popular model for long-range dependent traffic: Time is discrete. At each unit time a random number of sessions is initiated, having the distribution of a Poisson random variable with mean λ. Each of these sessions has a random duration τ, where the integer random variable τ has finite mean, infinite variance, and a regularly varying tail, i.e., P(τ >К) ~ К^-Lα L(К), where 1 < α < 2 L(·) is a slowly varying function. Once a session is initiated, it generates one cell at each unit of time until its termination. We examine the departure process of the leaky bucket policing mechanism driven by such an arrival process, and show that it too is long-range dependent for any token buffer size and any - finite or infinite - cell buffer size. Moreover, upper and lower bounds for the covariance sequence of the output process are established. The above results demonstrate that long-range dependence cannot be removed by the kinds of flow control schemes that are currently being envisioned for broadband networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

偏最小二乘回归的贝叶斯正则化神经网络集成模型在证券分析预测中的应用

神经网络集成技术能有效地提高神经网络的预测精度和泛化能力,已经成为机器学习和神经计算领域的一个研究热点.利用Bagging技术和不同的神经网络算法生成集成个体,并用偏最小二乘回归方法从中提取集成因子,再利用贝叶斯正则化神经网络对其集成,以此建立上证指数预测模型.通过上证指数开、收盘价进行实例分析,计算结果表明该方法预测精度高、稳定性好.     

Regularization of singular systems of linear algebraic equations by shifts

Regularization of singular systems of linear algebraic equations by shifts is examined. New equivalent conditions for the shift regularizability of such systems are derived.     

Algebraic structure of association schemes of prime order

Finite groups of prime order must be cyclic. It is natural to ask what about association schemes of prime order. In this paper, we will give an answer to this question. An association scheme of prime order is commutative, and its valencies of nontrivial relations and multiplicities of nontrivial irreducible characters are constant. Moreover, if we suppose that the minimal splitting field is an abelian extension of the field of rational numbers, then the character table is the same as that of a Schurian scheme.     

Frozen Landweber Iteration for Nonlinear Ill-Posed Problems

In this paper we propose a modification of the Landweber iteration termed frozen Landweberiteration for nonlinear ill-posed problems.A convergence analysis for this iteration is presented.The numericalperformance of this frozen Landweber iteration for a nonlinear Hammerstein integral equation is compared withthat of the Landweber iteration.We obtain a shorter running time of the frozen Landweber iteration based onthe same convergence accuracy.     

Numerical solution of the linear inverse problem for the Euler-Darboux equation

An inverse problem of the reconstruction of the right-hand side of the Euler-Darboux equation is studied. This problem is equivalent to the Volterra integral equation of the third kind with the operator of multiplication by a smooth nonincreasing function. Numerical solution of this problem is constructed using an integral representation of the solution of the inverse problem, the regularization method, and the method of quadratures. The convergence and stability of the numerical method is proved.     

DISSIPATIVE SCHEMES WITH PROPERTY OF INHERITING HOMOCLINIC ORBITS FOR 2N-DIMENSIONAL HAMILTONIAN SYSTEMS

1　ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｉｓｐａｐｅｒｉｓｄｅｖｏｔｅｄｔｏｓｔｕｄｙｗｈａｔｋｉｎｄｏｆｄｉｓｃｒｅｔｅｓｃｈｅｍｅｓｏｆｔｈｅｆｏｌｌｏｗｉｎｇ 2ｎ ｄｉｍｅｎ ｓｉｏｎａｌＨａｍｉｌｔｏｎｉａｎｓｙｓｔｅｍｓｗｉｔｈｐａｒａｍｅｔｅｒｉｎｎｏｒｍａｌｆｏｒｍ ｕ=Ｊ2ｎ Ｈ ｕＴ,　　Ｈ =Ｈ(ｕ ,λ) ,(1 )ｗｈｅｒｅｕ∈Ｒ2ｎ,λ∈Ｒ ,Ｈ∈Ｃｋ+1(Ｒ2ｎ×Ｒ ,Ｒ) ,ｋ≥ 6,ａｎｄＪ2ｎ =0Ｉｎ-Ｉｎ 0 ,Ｉｎ:ｕｎｉｔｍａｔｒｉｘｏｆｏｒｄｅｒｎｈａｓｔｈｅｐｒｏｐｅｒｔｙｏｆｉｎｈｅｒｉｔｉｎｇｈｏｍ…     

Numerical differentiation from a viewpoint of regularization theory

In this paper, we discuss the classical ill-posed problem of numerical differentiation, assuming that the smoothness of the function to be differentiated is unknown. Using recent results on adaptive regularization of general ill-posed problems, we propose new rules for the choice of the stepsize in the finite-difference methods, and for the regularization parameter choice in numerical differentiation regularized by the iterated Tikhonov method. These methods are shown to be effective for the differentiation of noisy functions, and the order-optimal convergence results for them are proved.

     

Precise lattice parameter measurements in CsCl-Br solid solutions between room temperature and 90°K by powder x-ray diffraction

Solid solutions of CsCl-Br in five different concentrations were prepared in sealed quartz tubes by heating the mixture to 1123°K for 6–8 hr and quenching to room temperature. X-ray diffractograms were taken at eight different temperatures between room temperature and 90°K for these solid solutions using the YPC50NM powder diffractometer and a continuous flow cryostat. The observed lattice parameters for each sample at each temperature obtained from the powder diffractograms were then extrapolated to give the true lattice parameters using the least square method with Nelson-Riley extrapolation scheme. The values of the true lattice parameters at each concentration and at each temperature were tabulated and the results discussed. It is shown that the lattice parameters vs temperature for some concentrations exhibit an anomalous behaviour. Contribution No. 691