连串反应中控制火焰的耦合GKS-CGL方程组解的极限行为

本文考虑连串反应中控制火焰的耦合广义Kuramoto Sivashinsky-Ginzburg Landau(GKS-CGL)方程组的周期初值问题,主要研究其解在系数g→0和δ→0时的极限行为.首先,采用Galerkin方法,通过构造一系列精细的先验估计,得到GKS-CGL方程组周期初值问题整体光滑解的存在唯一性.其次,利用一致有界估计证得GKS-CGL方程组极限解收敛,并给出解的收敛率估计.     

Estimates for correlations in billiards with large arcs

Bunimovich billiards are ergodic and mixing. However, if the billiard table contains very large arcs on its boundary then if there exist trajectories experience infinitely many collisions in the vicinity of periodic trajectories on the large arc. The hyperbolicity is nonuniform and the mixing rate is very slow. The corresponding dynamics are intermittent between regular and chaotic, which makes them particularly interesting in physical studies. The study of mixing rates in intermittent chaotic systems is mo...     

Asymptotic Behavior of the Value Functions of Discrete-Time Discounted Optimal Control

We study deterministic discounted optimal control problems associated with discrete-time systems. It is shown that, for small discount rates, the controllability properties of the underlying system can guarantee the convergence of the discounted value function to the value function of the average yield. An application in the theory of exponential growth rates of discrete inclusions is presented. This application motivates the analysis of infinite-horizon optimal control problems with running yields that are unbounded from below.     

爆炸力学数值模拟中本构建模问题的讨论

就爆炸力学数值模拟中的本构建模问题的有关内容作了讨论,包括:波传播研究与材料的动态特性研究的相互依赖、容变律与畸变律的解耦与耦合、率型本构关系与失效准则、应变率效应与温度效应的等效性、加载本构关系与卸载本构关系以及流变过程与损伤演化过程的耦合等,并展望了今后的有关发展动向。     

Another view on martingale central limit theorems

Based on the martingale version of the Skorokhod embedding Heyde and Brown (1970) established a bound on the rate of convergence in the central limit theorem (CLT) for discrete time martingales having finite moments of order 2+2δ with 0<δ1. An extension for all δ>0 was proved in Haeusler (1988). This paper presents a rather quick access based solely on truncation, optional stopping, and prolongation techniques for martingale difference arrays to obtain other upper bounds for sup

Full-size image

(φbeing the standard normal d.f.) yielding weak sufficient conditions for the asymptotic normality of . It is shown that our approach also yields two types of martingale central limit theorems with random norming.     

Quantum chemical construction of a reduced reaction Hamiltonian and T 1 -relaxation and pure T 2 -dephasing rates for the proton transfer in 3-chlorotropolone

Separating multidimensional problems into that of a relevant system which is coupled to a bath of harmonic oscillators is a common concept in condensed phase theory. Focusing on the specific problem of intramolecular proton transfer in an isolated tropolone derivative, we consider the reactive proton moving in the plane of the molecule as the system and the remaining substrate normal modes as the bath. An all-Cartesian system-plus-substrate Hamiltonian is constructed employing density functional theory. It is then used to determine the temperature-dependent effective reduced reaction Hamiltonian and the state-to-state dissipation rates induced via the system-substrate coupling up to the bi-quadratic order. The important substrate modes for the T₁-relaxation and the pure T₂-dephasing rates, which are either intra- or inter-well in nature, are identified numerically and analyzed physically with molecular details. Received 19 November 2001 and Received in final form 19 February 2002     

Spatial Nonparametric Regression Estimation: Non-isotropic Case

Data collected on the surface of the earth often has spatial interaction. In this paper, a non-isotropic mixing spatial data process is introduced, and under such a spatial structure a nonparametric kernel method is suggested to estimate a spatial conditional regression. Under mild regularities, sufficient conditions are derived to ensure the weak consistency as well as the convergence rates for the kernel estimator. Of interest are the following: (1) All the conditions imposed on the mixing coefficient and the bandwidth are simple; (2) Differently from the time series setting, the bandwidth is found to be dependent on the dimension of the site in space as well; (3) For weak consistency, the mixing coefficient is allowed to be unsummable and the tendency of sample size to infinity may be in different manners along different direction in space; (4) However, to have an optimal convergence rate, faster decreasing rates of mixing coefficient and the tendency of sample size to infinity along each direction a     

The effect of head position on glottic closure in patients with unilateral vocal fold paralysis

The present study was designed to assess the effect of head position on glottic closure as reflected in airflow rates (open quotient and maximum flow declination rate), in patients with unilateral vocal fold paralysis. Ten patients, 2 males and 8 females ranging in age from 40 to 75, with a mean age of 57.3, served as subjects. Airflow measures were taken during sustained phonation of two vowels (/i/ and /a/) in 3 head positions (center, right, left). Vowels /i/ and /a/ were produced at subject's comfortable pitch and loudness, with random ordering of both vowel order and head orientation. Subjects were trained to focus eye gaze on right and left markers (70-degree angle) and a central marker at eye level directly in front of the subject. Theoretically, if turning the head during phonation alters the laryngeal anatomic relationship by bringing the vocal folds in closer proximity to one another, then airflow rate should lessen. Our results indicate that head position does not improve glottic closure in these patients, which is in contrast to previously published research.(1) Our results question the utility and underlying theoretical construct for the use of head turning as a therapeutic technique for improvement of voice in patients with unilateral vocal fold paralysis.     

Estimating household purchase rates for consumer nondurable goods

Understanding the purchase rates of households for frequently purchased packaged goods is an important element in developing effective marketing strategies. Previous researchers have attempted to estimate these rates by assuming that the time between purchases is a random variable that follows some common parametric probability distribution such as the exponential or Weibull distribution. Recent research has shown that for many frequently purchased packaged goods, the interpurchase times cannot be adequately described by these commonly used probability distributions. In this study we demonstrate how household purchase rates can be estimated in a robust manner using a generalized semiparametric approach that obviates the need for specifying a parametric form for the distribution of interpurchase times. The motivation being that often there is no theory of household purchase behaviour that specifies a priori the probability distribution underlying the interpurchase times. Our empirical results indicate that, for the data analysed, the household purchase rates exhibit a regular pattern that cannot be recovered by probability distributions often used in previous research. Further, marketing actions taken by sellers do indeed influence household purchase behaviour.     

Least Squares Convex-Concave Data Smoothing

We consider n noisy measurements of a smooth (unknown) function, which suggest that the graph of the function consists of one convex and one concave section. Due to the noise the sequence of the second divided differences of the data exhibits more sign changes than those expected in the second derivative of the underlying function. We address the problem of smoothing the data so as to minimize the sum of squares of residuals subject to the condition that the sequence of successive second divided differences of the smoothed values changes sign at most once. It is a nonlinear problem, since the position of the sign change is also an unknown of the optimization process. We state a characterization theorem, which shows that the smoothed values can be derived by at most 2n – 2 quadratic programming calculations to subranges of data. Then, we develop an algorithm that solves the problem in about O(n ²) computer operations by employing several techniques, including B-splines, the use of active sets, quadratic programming and updating methods. A Fortran program has been written and some of its numerical results are presented. Applications of the smoothing technique may be found in scientific, economic and engineering calculations, when a potential shape for the underlying function is an S-curve. Generally, the smoothing calculation may arise from processes that show initially increasing and then decreasing rates of change.