审讯过程的数学模型

本文从经济学的观点出发，利用对策论方法建立了审讯过程的数学模型，并由此研究了讯问人三种主要策略对审讯成功的效度。     

Rapid and reproducible capillary electrophoretic separation of double-stranded DNA fragments in a simple methyl cellulosic sieving system

Summary A rapid, robust and reproducible method providing excellent separation performance and simplicity using a 0.5% MC-4000 methyl cellulosic sieving medium in DB-1 coated capillaries has been developed. The method is suitable for qualitative comparison of DNA restriction profiles for fragments in the size range 100–1000 base pairs (bp). Efficiencies up to 8.5 million plates/m (1057 bp fragment) were recorded. Peak resolution of 6 bp (291/297 bp, 335/341 bp) and 4 bp (238/242 bp, 341/345 bp) was achieved. In addition, 1 bp partial resolution of 123/124 bp and 298/297 bp was obtained. Run-to-run (n=15), day-to-day (n=4), and capillary-to-capillary (n=3) variations of 0.1–0.2% RSD, 0.3–0.5% RSD, and 0.1–0.3% RSD, respectively, were observed. The MC-4000 sieving matrix was found to be better than hydroxypropyl methyl cellulose and hydroxypropyl cellulose, in terms of both performance and stability in the DB-1 coated capillaries. The efficiency and resolution in DB-WAX capillaries were inferior to those obtained in DB-1 capillaries. The commercially available DB-1 capillaries were stable for months in the sieving medium at pH 8.3 and could be regenerated to provide high efficiency after accidental current breaks.     

Pseudo-Strong Regularity Around a Set

A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ.     

谱任意的符号模式矩阵

一个n阶符号模式矩阵A称为是谱任意的,如果对任意的实系数n次首1多项式r(x),在A的定性矩阵类Q(A)中至少存在一个实矩阵B,使得B的特征多项式是r(x),文中证明了当n为奇数时n阶谱任意符号模式矩阵是存在的。     

随机环境中双移民生灭过程的极限性质

引入了随机环境中双移民生灭过程的概念，定义了过程的模态指示函数，在此基础上研究了其转移矩阵的平稳分布，给出了平稳分布众数的位置与模态指示函数之间的关系．研究了平稳分布的众数与边界关系．     

两类整函数的素性

本文就用Nevanlinna理论研究了两类整函数的素性，所得结果推广了Prokopovich和华歆厚的有关定理。     

Estimates for Elements of Inverse Matrices for a Class of Operators with Matrices of Special Structure

In this paper, we consider questions related to the structure of inverse matrices of linear bounded operators acting in infinite-dimensional complex Banach spaces. We obtain specific estimates of elements of inverse matrices for bounded operators whose matrices have a special structure. Matrices are introduced as special operator-valued functions on an index set. The matrix structure is described by the behavior of the given function on elements of a special partition of the index set. The method used for deriving the estimates is based on an analysis of Fourier series of strongly continuous periodic functions.     

QUATERNION GENERALIZED SINGULAR VALUE DECOMPOSITION AND ITS APPLICATIONS

This paper derives a theorem of generalized singular value decomposition of quaternion matrices （QGSVD）,studies the solution of general quaternion matrix equation AXB -CYD= E,and obtains quaternionic Roth＇s theorem. This paper also suggests sufficient and necessary conditions for the existence and uniqueness of solutions and explicit forms of the solutions of the equation.     

运输网络中最小饱和流的求解

运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.     

D_x-广义正定矩阵

讨论Dx广义正定阵的问题,给出了Dx广义正定阵的一些等价性的刻划,同时还讨论了Dx广义正定阵的若干性质.