一阶贝塞尔函数广义积分的数值计算

物理勘探中,需要计算含一阶贝塞尔函数的广义积分.一种传统的方法是在贝塞尔函数零点之间一次应用一般积分法则积分,最后求和,这种方法收敛比较慢,特别在贝塞尔函数中r值很大的时候.另一种应用广泛的方法是数字滤波技术,该法比第一种方法快,但要求核函数迅速衰减.本文给出了一种新的计算方法,能处理核函数衰减很慢且r很大的问题,方法简单,高效率,精度高.     

非线性抛物型初边值问题的差分-边界有限元耦合方法及其误差估计

一、引言边界元方法以其对于无界区域问题的独特有效性及其它一些性质,在工程技术和计算数学领域得到越来越广泛的重视、应用和研究.对于椭圆型边值问题,边界元方法的应用和理论研究已是硕果累累,对于发展型的初边值问题,近十年来,其理论研究在某些方面已取得了突破性进展,但仍有许多方面处于空白.发展型方程的边界元方法基本上分为三种类型:第一种类型是利用发展型方程的基本解导出发展型的边界积分方程;第二种类型是通过可逆积分变换将发展方程转化为椭圆型方程;第三种类型是对于时间变量采用差分离散化,将发展型方程转化成一组椭圆型方程.对于第一种类型方法的应用和理论研究已日臻完善.但对于第三种类型方法的理论分析尚属空白.本文研究第三种类型方法的应用及其误差分析,给出了数值计算格式和近似解的先验误差估计.     

基于可拓分析的信息模式识别方法

采用可拓评判方法,应用物元概念和关联函数,确定了玉米螟种群动态分级识别的的经典域物元和节域物元,提出了一种新的基于可拓分析的信息模式识别方法,并探讨了其应用.应用结果表明,历史拟合率达100%,1995、1996两年预报,其结果与实际一致.说明该识别方法具有良好的应用前景,一种全新的模式识别分类器.     

属性层次模型AHM在选股决策中的应用

应用属性层次模型 AHM进行选股决策 .属性层次模型 AHM方法简便易行 .实证表明 ,属性层次模型 AHM方法是一种有效的股票选择方法 .     

基于小波系数相对模糊关系的水印方法

提出一种基于带参数整数小波变换和相对小波系数模糊关系的数字水印算法.应用基于视觉系统小波域量化噪声的视觉权重分析方法,自适应的构造模糊关系矩阵,在水印的提取过程中实现了盲检测.本方法与经典的密码理论以及高级加密算法相结合.应用Rabin方法生成单向Hash函数,信息隐藏算法可以完全公开.水印算法不可感知性好,鲁棒性强,是一种有效的版权保护方法.     

构造微元的"等式极限法"及应用

介绍一种在定积分应用中构造微分元素的方法,并给出了两个应用的例子.     

强混合序列的联结构造与完全收敛性

对强混合随机变量序列,提出一种"联结构造”方法.作为它的应用,给出强混合序列的完全收敛性.这里的方法,也为处理其它相依随机变量序列,提供一种新的途径.     

线性混合模型中方差分量的估计与QR分解

在线性混合模型中, 极大似然估计是一种很重要的估计方法, 但是它常常需要通过迭代求解. 应用设计阵的QR分解, 可以把设计阵变换成上三角矩阵. 这样可以降低参与迭代运算的矩阵的阶数, 还可以减少参与运算的数据量, 从而提高运算的速度. 本文讨论了QR分解在EM算法中的应用, 并用模拟的方法验证了QR分解可以极大的提高运算的速度. 本文同时讨论了QR分解在另外一种估计方法, 即ANOVA估计中的应用.     

平面直角坐标系中三角形面积的计算

在初中几何中,三角形的面积有很多种计算方法,如S=1/2ah,S=1/2absinC,海伦公式.但是这些方法在直角坐标系中往往很难应用,本文介绍一种简单的方法并举例说明它的应用.     

有理函数的积分

应用导数运算,给出有关有理函数积分的一种计算方法.     

关于药物对小鼠肝脏细胞色素P-450含量的影响实验结果的分析

肝药酶诱导剂苯巴比妥能诱导细胞色素P-450的合成,而肝药酶抑制剂放线菌素D能抑制细胞色素P-450的合成,本实验应用示差光谱法对P-450含量加以测定.本文改进了传统的计算药后诱导组和抑制组P-450含量增加或减少的百分比来评价药物的方法,在M athem atica数学软件环境下,对数据进行方差分析和t检验,提高了数据处理精度和可信度.并对原方法表示怀疑.     

泛系分析:数学·方法论·相对论·辩证思维

基于对广义系统、泛导、泛对称、泛箱原理、泛系相对性提出了新的分析模式与新的相对数学化的简化强化的定义,发展了泛系方法论与泛系相对论的框架与理法,具体内容涉及:相对普适的数学化的泛系,200类对偶,对偶转化,泛对称转化,泛系辩证,八畴方法,泛系数学方法,广义量化,逼近转化原则,泛等价定理,供求分析,思维实验,广义灰色系统,等等.     

Transverse compression of PPTA fibers

Results of single transverse compression testing of PPTA and PIPD fibers, using a novel test device, are presented and discussed. In the tests, short lengths of single fibers are compressed between two parallel, stiff platens. The fiber elastic deformation is analyzed as a Hertzian contact problem. The inelastic deformation is analyzed by elastic-plastic FE simulation and by laser-scanning confocal microscopy of the compressed fibers ex post facto. The results obtained are compared to those in the literature and to the theoretical predictions of PPTA fiber transverse elasticity based on PPTA crystal elasticity.Presented at the 11th International Conference on Mechanics of Composite Materials (Riga, June 11–15, 2000).3TEX, Inc. 109, MacKenan Drive, Cary, North Carolina 27511, USA. Published in Mekhanika Kompozitnykh Materialov, Vol. 36, No. 4, pp. 533–544, March–April, 2000.     

网络优化中一个组合问题的探讨

文[4]提出了网络优化中若干有待解决的组合问题，本文围绕其中之一“减小直径问题”进行了探讨．设P（n，t）表示长为n的路径增加t条边后所得图直径的最小值，C（n，t）表示长为n的圈增加t条边后所得回直径的最小值．本文取得如下进展：1）给出P（n，2），P（n，3）及C（n，2）的精确值，并得出P（n，4）的一更精细的上界及一种更好的加边方式．上述结果均满足小极大度原则．2）在有极大度限制的条件下，分别对t为偶数和奇数给出了P（n，t）的上界．     

由算子定义的一类p叶解析函数性质

通过Hadarnard卷积定义算子I<,n+p-1>,并利用其引进了新的解析函数类H(p,n,δ,A,B),研究了函数f(z)(f(z)∈A<,p>)属于函数类H(p,n,δ,A,B)的充分条件和部分和性质,同时还考虑了类H(p,n,δ,A,B)的卷积性质.     

GENERALIZED Ⅰ-NONEXPANSIVE MAPS AND INVARIANT APPROXIMATION RESULTS IN p-NORMED SPACES

We extend the concept of R-subcommuting maps due to Shahzad[17,18] to the case of non-starshaped domain and obtain a common fixed point result for this class of maps on non-starshaped domain in the setup of p-normed spaces. As applications, we establish noncommutative versions of various best approximation results for generalized I-nonexpansive maps on non-starshaped domain. Our results unify and extend that of Al-Thagafi, Dotson, Habiniak, Jungck and Sessa, Latif, Sahab, Khan and Sessa and Shahzad.     

Dynamic properties of composite laminates and panels with highly contrasting directions of anisotropy

An asymptotic analysis of the dynamic stress-strain state of a thin laminar packet of anisotropic layers is presented. The statement is nonclassical, since in layer materials the ratio of elastic moduli in the longitudinal and transverse directions can generate small parameters comparable to the relative half-thickness of the packet, as, for example, in high-strength unidirectional composites. Alternation of strong load-carrying layers and a relatively soft filler with a similar difference in the elastic moduli between the layers is also allowed. The averaged two-dimensional equations and the total stress tensor in the layers are determined. The results are classified with respect to the types of anisotropy and the indices of differences in the elastic moduli. It is shown that first-approximation models lead to kinematic relations similar to those of the theories of high-order shear strains. Institute of Problems of Mechanics, Russian Academy of Sciences, Moscow, Russia. Translated from Mekhanika Kompozitnykh Materialov, Vol. 35, No. 5, pp. 605–614, September–October, 1999.     

Formulation of linear problems and solution by a universal machine

Using the predicate language for ordered fields a class of problems referred to aslinear problems is defined. This class contains, for example, all systems of linear equations and inequalities, all linear programming problems, all integer programming problems with bounded variables, all linear complementarity problems, the testing of whether sets that are defined by linear inequalities are semilattices, all satisfiability problems in sentenial logic, the rank-computation of matrices, the computation of row-reduced echelon forms of matrices, and all quadratic programming problems with bounded variables. A single, one, algorithm, to which we refer as theUniversal Linear Machine, is described. It solves any instance of any linear problem. The Universal Linear Machine runs in two phases. Given a linear problem, in the first phase a Compiler running on a Turing Machine generates alinear algorithm for the problem. Then, given an instance of the linear problem, in the second phase the linear algorithm solves the particular instance of the linear problem. The linear algorithm is finite, deterministic, loopless and executes only the five ordered field operations — additions, multiplications, subtractions, divisions and comparisons. Conversely, we show that for each linear algorithm there is a linear problem which the linear algorithm solves uniquely. Finally, it is shown that with a linear algorithm for a linear problem, one can solve certain parametric instances of the linear problem.Research was supported in part by the National Science Foundation Grant DMS 92-07409, by the Department of Energy Grant DE-FG03-87-ER-25028, by the United States—Israel Binational Science Foundation Grant 90-00434 and by ONR Grant N00014-92-J1142.Corresponding author.     

Immersive Projection Technology for Visual Data Mining

The PlatoCAVE, the MiniCAVE, and the C2 are immersive stereoscopic projectionbased virtual reality environments oriented toward group interactions. As such they are particularly suited to collaborative efforts in data analysis and visual data mining. In this article, we provide an overview of virtual reality in general, including immersive projection technology, and the use of stereoscopic displays for data visualization. We discuss design considerations for the construction of these immersive environments including one-wall versus four-wall implementations, augmented reality, stereoscopic placement, head tracking, the use of LCD devices, polarized light stereo, voice control, and image synchronization.