Two problems in the 筭數書 Suanshu shu (Book of Mathematics): Geometric relations between circles and squares and methods for determining their mutual relations

Much research has been devoted to two problems, Yi yuancai fang (From a circular timber [find] a square) and Yi fangcai yuan (From a square timber [find] a circle), both of which appear in the Suanshu shu, an early Han dynasty mathematical work written on bamboo slips, excavated from tomb 247 at Zhangjiashan in Hubei Province, China. In this article, the geometric relations between circles and squares and the methods for determining their mutual relations in these two problems are interpreted in a different way, and an alternative approach is offered for reconciling these two problems.     

Scheduling networks of queues: Heavy traffic analysis of a simple open network

We consider a queueing network with two single-server stations and two types of customers. Customers of type A require service only at station 1 and customers of type B require service first at station 1 and then at station 2. Each server has a different general service time distribution, and each customer type has a different general interarrival time distribution. The problem is to find a dynamic sequencing policy at station 1 that minimizes the long-run average expected number of customers in the system.The scheduling problem is approximated by a dynamic control problem involving Brownian motion. A reformulation of this control problem is solved, and the solution is interpreted in terms of the queueing system in order to obtain an effective sequencing policy. Also, a pathwise lower bound (for any sequencing policy) is obtained for the total number of customers in the network. We show via simulation that the relative difference between the performance of the proposed policy and the pathwise lower bound becomes small as the load on the network is increased toward the heavy traffic limit.     

Divisors of the number of Latin rectangles

A k×n Latin rectangle on the symbols {1,2,…,n} is called reduced if the first row is (1,2,…,n) and the first column is T(1,2,…,k). Let Rk,n be the number of reduced k×n Latin rectangles and m=⌊n/2⌋. We prove several results giving divisors of Rk,n. For example, (k−1)! divides Rk,n when k?m and m! divides Rk,n when m<k?n. We establish a recurrence which determines the congruence class of for a range of different t. We use this to show that Rk,n≡((−1)^k−1(k−1)!)ⁿ⁻¹. In particular, this means that if n is prime, then Rk,n≡1 for 1?k?n and if n is composite then if and only if k is larger than the greatest prime divisor of n.     

THE REDUCED BASIS TECHNIQUE AS A COARSE SOLVER FOR PARAREAL IN TIME SIMULATIONS

In this paper, we extend the reduced basis methods for parameter dependent problems to the parareal in time algorithm introduced by Lions et al. [12] and solve a nonlinear evolutionary parabolic partial differential equation. The fine solver is based on the finite element method or spectral element method in space and a semi-implicit Runge-Kutta scheme in time. The coarse solver is based on a semi-implicit scheme in time and the reduced basis approximation in space. Of[line-online procedures are developed, and it is proved that the computational complexity of the on-line stage depends only on the dimension of the reduced basis space （typically small）. Parareal in time algorithms based on a multi-grids finite element method and a multi-degrees finite element method are also presented. Some numerical results are reported.     

有势场逆问题的边界元法

本文给出了位势方程逆问题的一种最小二乘边界元解法。控制方程为Ｌａｐｌａｃｅ方程，但一部分边界上未给出任何边值，而只在某些内点上给出了势函值。这一问题在数学上属不适定问题，但在一定条件下存在唯一解。本文同时给出了一种估计解的可靠性的方法。数值试验表明，这类逆问题采用边界元法是非常有效的。     

高负荷下带重尾服务强占优先排队的扩散逼近

考虑的排队系统是单服务台,顾客的初始到来是依泊松过程来到服务台,顾客的服务时间是重尾分布,服务的原则是强占优先服务.在高负荷条件下对此模型进行研究,获得了系统中的负荷过程,离去过程和队长过程的扩散逼近.     

When is the pseudo-best estimator blue?

Summary Linear unbiased estimation of the mean of a random variable in Hilbert space is treated in the typical case where the mean belongs to a known subspace. The best linear estimate depends on the underlying covariance operatorB ₀ of the random variable. This operatorB ₀, however, is rarely completely known, so that an auxiliary operatorB is used to compute a “pseudo-best” estimate. It is shown that the best and the pseudo-best estimates coincide, if and only ifB ₀ B ⁻¹ leavesM invariant. Applications to linear regression are to be found in the references.     

Some analytical results for congestion in subscriber line modules

In modern telephone exchanges, subscriber lines are usually connected to the so-called subscriber line modules. These modules serve both incoming and outgoing traffic. An important difference between these two types of calls lies in the fact that in the case of blocking due to all channels busy in the module, outgoing calls can be queued whereas incoming calls get busy signal and must be re-initiated in order to establish the required connection. The corresponding queueing model was discussed recently by Lederman, but only the model with losses has been studied analytically. In the present contribution, we study the model which takes into account subscriber retrials and investigate some of its properties such as existence of stationary regime, derive explicit formulas for the system characteristics, limit theorems for systems under high repetition intensity of blocked calls and limit theorems for systems under heavy traffic.     

基于小波核偏最小二乘回归方法的混沌系统建模研究

基于核学习的强大非线性映射能力,结合用于回归建模的线性偏最小二乘(PLS)算法,提出一种小波核偏最小二乘(WKPLS)回归方法. 该方法基于支持向量机使用的经典核函数技巧,将输入映射到高维非线性的特征空间,在特征空间中,构造线性的PLS回归模型. PLS方法利用输入与输出变量之间的协方差信息提取潜在特征,而可允许的小波核函数具有近似正交以及适用于信号局部分析的特性. 因此,结合它们优点的WKPLS方法显示了更好的非线性建模性能. 将WKPLS方法应用在非线性混沌动力系统建模上,并与基于高斯核的核偏最小二乘 关键词： 小波核 偏最小二乘回归 混沌系统 建模     

基于可见-近红外光谱技术预测茶鲜叶全氮含量

为快速无损监测茶树氮素营养及其生长状况,基于可见-近红外光谱技术建立了茶鲜叶全氮含量的预测模型。以茶鲜叶为对象,田间试验使用便携式光谱仪采集叶片漫反射光谱信息,通过不同预处理和统计分析,建立茶鲜叶全氮含量预测的光谱模型。试验共采集111个样品,其中86个样品作校正集,25个样品作预测集。通过一阶导数与滑动平均滤波相结合的预处理方法,用7个主成分建立的偏最小二乘模型最好,其校正集均方根误差(RMSEC)为0.097 3,预测集的相关系数为0.888 1,预测均方根误差(RMSEP)为0.130 4,预测的平均相对误差为4.339%。研究结果表明,利用可见-近红外光谱技术可以很好地预测茶鲜叶全氮含量,对于快速实时监测茶树长势和施肥管理具有重要指导意义。