NCD系统的数学理论

无索赔折扣系统(No Claim Discount system,简记为NCD系统)是世界各国机动车辆险中广泛采用的一种经验费率厘定机制.本文尝试建立了NCD系统严谨的数学理论, 重点讨论了NCD系统的数学建模和稳态分析.此外,作为本文必要的数学前提,首先在第2节着重探讨了随机矩阵间的随机优序关系,并将所得结论运用至齐次不可约且遍历的马尔科夫链的研究中,这些内容也有其独立的数学上的兴趣.     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.     

Critical Point Theorems and Applications to Differential Equations

This paper contains a generalization of the well-known Palais-Smale and Cerami compactness conditions. The compactness condition introduced is used to prove some general existence theorems for critical points. Some applications are given to differential equations.     

新核素278113的基态特性及其α衰变链的研究

用形变的相对论平均场模型,Skyrme-Hartree-Fock模型及宏观-微观模型研究了新核素²⁷⁸113及其α衰变链的α衰变能和半衰期.计算的α衰变能同实验数据比较符合,相应的半衰期也在合理的范围内.计算进一步表明形变对超重核的基态性质有重要影响.     

Ergodic isospectral theory of the Lax pairs of Euler equations with harmonic analysis flavor

Isospectral theory of the Lax pairs of both 3D and 2D Euler equations of inviscid fluids is developed. Eigenfunctions are represented through an ergodic integral. The Koopman group and mean ergodic theorem are utilized. Further harmonic analysis results on the ergodic integral are introduced. The ergodic integral is a limit of the oscillatory integral of the first kind.

     

Statistical thermodynamics evaluation of polymer–polymer miscibility

The Simha and Somcynsky (S–S) statistical thermodynamics theory was used to compute the solubility parameters as a function of temperature and pressure [δ = δ(T, P)], for a series of polymer melts. The characteristic scaling parameters required for this task, P*, T*, and V*, were extracted from the pressure–temperature–volume (PVT) data. To determine the potential polymer–polymer miscibility, the dependence of δ versus T (at ambient pressure) was computed for 17 polymers. Close proximity of the δ versus T curves for four miscible polymer pairs: PPE/PS, PS/PVME, and PC/PMMA signaled the usefulness of this approach. It is noteworthy, that the tabulated solubility parameters (derived from the solution data under ambient conditions) propounded the immiscibility of the PVC/PVAc pair. The computed values of δ also suggested miscibility for polymer pairs of unknown miscibility, namely PPE/PVC, PPE/PVAc, and PET/PSF. In recognizing the limitations of the solubility parameter approach (the omission of several thermodynamic contributions), these preliminary results are auspicious because they indicate a new route for estimating the miscibility of any polymeric material at a given temperature and pressure. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 2909–2915, 2004     

Kinetic Studies on the Reaction of Sodium Hexa-cyanoferrate(II) Complex with Peroxydisulfate Anion

Introduction In the previous studies on the oxidation reaction,peroxydisulfate was widely used as an oxidizingagent.1-5 One of the advantages of this oxidant lies in itsstability in a wide range of pH values. The reaction be-tween Fe(CN)5L3- (L=N-aromatic heterocyclic li-gands) and S2O8 2- has been proved to proceed throughan outer-sphere electron transfer mechanism.5 For a re-action [(Eq. (1)] to be under an outer-sphere mechanismthe steps involved are the formation of a reactant …     

Studies on the Adsorption of Asymmetrical Triblock Copolymers by Scheutjens-Fleer Theory and Monte Carlo Simulation

The adsorption of asymmetrical triblock copolymers from a non-selective solvent on solid surface has been studied by using Scheutjens-Fleer mean-field theory and Monte Carlo simulation method on lattice model. The main aim of this paper is to provide detailed computer simulation data, taking A8-kB20Ak as a key example, to study the influence of the structure of copolymer on adsorption behavior and make a comparison between MC and SF results. The simulated results show that the size distribution of various configurations and density-profile are dependent on molecular structure and adsorption energy. The molecular structure will lead to diversity of adsorption behavior. This discrepancy between different structures would be enlarged for the surface coverage and adsorption amount with increasing of the adsorption energy. The surface coverage and the adsorption amount as well as the bound fraction will become larger as symmetry of the molecular structure becomes gradually worse. The adsorption layer becomes thicker with increasing of symmetry of the molecule when adsorption energy is smaller but it becomes thinner when adsorption energy is higher. It is shown that SF theory can reproduce the adsorption behavior of asymmetrical triblock copolymers. However, systematic discrepancy between the theory and simulation still exists.The approximations inherited in the mean-filed theory such as random mixing and the allowance of direct back folding may be responsible for those deviations.     

Elliptic and parabolic problems in unbounded domains

We consider elliptic and parabolic problems in unbounded domains. We give general existence and regularity results in Besov spaces and semi‐explicit representation formulas via operator‐valued fundamental solutions which turn out to be a powerful tool to derive a series of qualitative results about the solutions. We give a sample of possible applications including asymptotic behavior in the large, singular perturbations, exact boundary conditions on artificial boundaries and validity of maximum principles. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

An approach to deciding the observational equivalence of Algol-like languages

We prove that the observational equivalence of third-order finitary (i.e. recursion-free) Idealized Algol (IA) is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function f_M. Given any such f_M, we construct a real-time deterministic pushdown automaton (DPDA) that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable.