On pointwise decay rates of time‐periodic solutions to the Navier–Stokes equation

We study the existence of a time‐periodic solution with pointwise decay properties to the Navier–Stokes equation in the whole space. We show that if the time‐periodic external force is sufficiently small in an appropriate sense, then there exists a time‐periodic solution $\{u,p\}$ of the Navier–Stokes equation such that $|{?}^j{u(t,x)|=O(|x|}^{1?n?j})$ and $|{?}^j{p(t,x)|=O(|x|}^{?n?j})(j=0,1,\dots )$ uniformly in $t\in \mathbb{R}$ as $|x|\to \infty$. Our solution decays faster than the time‐periodic Stokes fundamental solution and the faster decay of its spatial derivatives of higher order is also described.     

Mass distribution and skewness for passive scalar transport in pipes with polygonal and smooth cross sections

We extend our previous results characterizing the loading properties of a diffusing passive scalar advected by a laminar shear flow in ducts and channels to more general cross‐sectional shapes, including regular polygons and smoothed corner ducts originating from deformations of ellipses. For the case of the triangle and localized, cross‐wise uniform initial distributions, short‐time skewness is calculated exactly to be positive, while long‐time asymptotics shows it to be negative. Monte Carlo simulations confirm these predictions, and document the timescale for sign change. The equilateral triangle appears to be the only regular polygon with this property—all others possess positive skewness at all times. Alternatively, closed‐form flow solutions can be constructed for smooth deformations of ellipses, and illustrate how both nonzero short‐time skewness and the possibility of multiple sign switching in time is unrelated to domain corners. Exact conditions relating the median and the skewness to the mean are developed which guarantee when the sign for the skewness implies front (more mass to the right of the mean) or back (more mass to the left of the mean) “loading” properties of the evolving tracer distribution along the pipe. Short‐ and long‐time asymptotics confirm this condition, and Monte Carlo simulations verify this at all times. The simulations are also used to examine the role of corners and boundaries on the distribution for short‐time evolution of point source , as opposed to cross‐wise uniform, initial data.     

Finite‐size corrections at the hard edge for the Laguerre β ensemble

A fundamental question in random matrix theory is to quantify the optimal rate of convergence to universal laws. We take up this problem for the Laguerre β ensemble, characterized by the Dyson parameter β, and the Laguerre weight , in the hard edge limit. The latter relates to the eigenvalues in the vicinity of the origin in the scaled variable . Previous work has established the corresponding functional form of various statistical quantities—for example, the distribution of the smallest eigenvalue, provided that . We show, using the theory of multidimensional hypergeometric functions based on Jack polynomials, that with the modified hard edge scaling , the rate of convergence to the limiting distribution is , which is optimal. In the case , general the explicit functional form of the distribution of the smallest eigenvalue at this order can be computed, as it can for and general . An iterative scheme is presented to numerically approximate the functional form for general .     

Optimal Planar Interception with Fixed End Conditions: Approximate Solutions

In a previous paper (Ref. 1), an exact solution of the optimal planar interception with fixed end conditions was derived in closed form. The optimal control was expressed as an explicit function of the state variables and two fixed parameters, obtained by solving a set of nonlinear algebraic equations involving elliptic integrals. In order to facilitate the optimal control implementation, the present paper derives a highly accurate simplified solution assuming that the ratio of the pursuer turning radius to the initial range is small. An asymptotic expansion further reduces the computational workload. Construction of a near-optimal open-loop control, based on the approximations, completes the present paper.     

Computation of limit periodic continued fractions. A survey

Over the last 20 years a large number of algorithms has been published to improve the speed and domain of convergence of continued fractions. In this survey we show that these algorithms are strongly related. Actually, they essentially boil down to two main principles.We also prove some results on asymptotic expansions of tail values of limit periodic continued fractions.Dedicated to Luigi Gatteschi on his seventieth birthdayThis research was partially supported by The Norwegian Research Council and by the HMC project ROLLS, under contract CHRX-CT93-0416.     

可重构制造系统重组过程中设备选择模型的研究

根据生产任务选择加工设备进行制造资源重组是实现可重构制造系统的关键问题之一，由于设备的选择涉及到多种因素，既有定量指标，又有定性指标，传统的依靠人工经验的方法显得力不从心。本文首先结合实际情况，提出了一套设备选择评价体系，通过对模糊判断矩阵采用最小对数二乘法确定各评价因素的权重系数，针对定性指标和定量指标采用不同的方法确定其性能指标值，通过模糊积分对评判指标进行综合评判，最后进行了实例研究。所提出的方法有效地简化了决策过程，为可重构制造系统设备选择提供了一套行之有效的方法。     

主成分分析在地区科技竞争力评测中的应用

近年来对于科技竞争力的研究在国内方兴未艾,其中对于科技竞争力的评测是众多学者研究的重点和热点,也是各级决策者最为关心、最为重要的课题之一。本文根据科技竞争力概念和内涵来确定评测指标体系的构成要素,建立了评测指标体系,并利用主成分分析方法对采集来的数据进行分析,得到最终的评测结果。     

Linear EV model with replicate observations on independent variables

This paper studies the linear EV model when replicate observations are made only on independent variables. We construct the estimates of regression coefficients and prove the consistency and asymptotic normality under some proper conditions. Results obtained reveal the difference between the case where the independent and dependent variables are observed repeatedly and simultaneously and the case studied in this article.     

Orthogonal double covers by super‐extendable cycles

An Orthogonal Double Cover (ODC) of the complete graph K_n by an almost‐hamiltonian cycle is a decomposition of 2K_n into cycles of length n?1 such that the intersection of any two of them is exactly one edge. We introduce a new class of such decompositions. If n is a prime, the special structure of such a decomposition allows to expand it to an ODC of K_n+1 by an almost‐hamiltonian cycle. This yields the existence of an ODC of K_p+1 by an almost‐hamiltonian cycle for primes p of order 3 mod 4 and its eventual existence for arbitrary primes p. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 283–293, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10011