On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

Normalization and Fermi–Coulomb and Coulomb hole sum rules for approximate wave functions

For approximate wave functions, we prove the theorem that there is a one‐to‐one correspondence between the constraints of normalization and of the Fermi–Coulomb and Coulomb hole charge sum rules at each electron position. This correspondence is surprising in light of the fact that normalization depends on the probability of finding an electron at some position. In contrast, the Fermi–Coulomb hole sum rule depends on the probability of two electrons staying apart because of correlations due to the Pauli exclusion principle and Coulomb repulsion, while the Coulomb hole sum rule depends on Coulomb repulsion. We demonstrate the theorem for the ground state of the He atom by the use of two different approximate wave functions that are functionals rather than functions. The first of these wave function functionals is constructed to satisfy the constraint of normalization, and the second that of the Coulomb hole sum rule for each electron position. Each is then shown to satisfy the other corresponding sum rule. The significance of the theorem for the construction of approximate “exchange‐correlation” and “correlation” energy functionals of density functional theory is also discussed. © 2006 Wiley Periodicals, Inc. Int J Quantum Chem, 2007     

p+209Bi核反应微观数据的理论计算

利用光学模型、激光模型、蒸发模型及扭曲波玻恩近似理论,对入射能量从阈能到300MeV,p+²⁰⁹Bi的中子反应截面、剩余核截面、出射粒子的多重数进行了理论计算及分析,并将计算结果与实验数据进行了比较.同时得到一组能量到50?0MeV与实验数据符合很好的光学势参数.     

Detecting and Diagnostic Checking Multivariate Conditional Heteroscedastic Time Series Models

Two tests for multivariate conditional heteroscedastic models are proposed. One is based on the cross-correlations of standardized squared residuals and the other is a score (Lagrange multiplier) test. The cross-correlations test can be used to detect the presence of multivariate conditional heteroscedasticity whereas the other test can be used for diagnostic checking. Simulation studies on the size and power of the test statistics are reported. The application of the tests is illustrated by an example using the S & P 500 and Sydney All Ordinary Indexes.     

Viscosity solutions of fully nonlinear parabolic systems

In this paper, we discuss the viscosity solutions of the weakly coupled systems of fully nonlinear second-order degenerate parabolic equations and their Cauchy-Dirichlet problem. We prove the existence, uniqueness and continuity of viscosity solution by combining Perron's method with the technique of coupled solutions. The results here generalize those in Proc. London Math. Soc. 63 (1991) 212-240 and Comm. Partial Differential Equations 16 (1991) 1095-1128.     

Canonical correlation analysis based on information theory

In this article, we propose a new canonical correlation method based on information theory. This method examines potential nonlinear relationships between p×1 vector Y-set and q×1 vector X-set. It finds canonical coefficient vectors a and b by maximizing a more general measure, the mutual information, between a^TX and b^TY. We use a permutation test to determine the pairs of the new canonical correlation variates, which requires no specific distributions for X and Y as long as one can estimate the densities of a^TX and b^TY nonparametrically. Examples illustrating the new method are presented.     

Total synthesis of (±) maculalactone A, maculalactone B and maculalactone C and the determination of the absolute configuration of natural (+) maculalactone A by asymmetric synthesis

Maculalactones A, B and C from the marine cyanobacterium Kyrtuthrix maculans are amongst the only compounds based on the tribenzylbutyrolactone skeleton known in nature and (+) maculalactone A from the natural source possesses significant biological activity against various marine herbivores and marine settlers. We now report a concise synthesis of racemic maculalactone A in five steps from inexpensive starting materials. Maculalactones B and C were synthesized by a minor modification to this procedure, and the synthetic design also permitted an asymmetric synthesis of maculalactone A to be achieved in around 85% ee. The (+) and (−) enantiomers of maculalactone A were assigned, respectively, to the S and R configurations on the basis of the chiral selectivity expected for catecholborane reduction of an unsymmetrical ketone in the presence of Corey's oxazoborolidine catalyst. Surprisingly, it appeared that natural (+) maculalactone A was biosynthesized in K. maculans in a partially racemic form, comprising ca. 90-95% of the (S) enantiomer and 5-10% of its (R) enantiomer. Coincidentally therefore, the percentage enantiomeric excess of the product obtained from asymmetric synthesis almost exactly matched that found in nature.     

红外单站被动定位技术速度更新算法研究

针对红外单站被动定位技术中空中机动目标的运动速度不断变化这一实际情况,提出了一种基于红外相机运动特性的对目标的运动速度进行实时更新的校正算法.该算法克服了大多基于匀速直线运动这一空间模型的红外单站被动定位方案目标速度不变的缺点,客观地反映了空中机动目标的实际运动状况,不仅能对目标的运动速度进行实时准确的更新校正,而且可推演出一种新的红外单站被动定位算法,对推动红外单站被动定位技术的工程实用化进程具有重要的意义.     

高阶非线性时滞差分方程解的渐近性

研究如下的具强迫项的高阶非线性时滞差分方程△^my(n) u(n)l↑∑i=1 gi(y(n-τ))=v(n)其中，m≥1，u,v：N→R，gi：R→R且τ∈{0，1，2，3，…)，i=1，2，…，l，得到了使该方程的解具有某种渐近性态的充分条件。     

Near-Optimal Controls of Discrete-Time Dynamic Systems Driven by Singularly-Perturbed Markov Chains

This work is devoted to near-optimal controls of large-scale discrete-time nonlinear dynamic systems driven by Markov chains; the underlying problem is to minimize an expected cost function. Our main goal is to reduce the complexity of the underlying systems. To achieve this goal, discrete-time control models under singularly-perturbed Markov chains are introduced. Using a relaxed control representation, our effort is devoted to finding near-optimal controls. Lumping the states in each irreducible class into a single state gives rise to a limit system. Applying near-optimal controls of the limit system to the original system, near-optimal controls of the original system are derived.