有势场逆问题的边界元法

本文给出了位势方程逆问题的一种最小二乘边界元解法。控制方程为Ｌａｐｌａｃｅ方程，但一部分边界上未给出任何边值，而只在某些内点上给出了势函值。这一问题在数学上属不适定问题，但在一定条件下存在唯一解。本文同时给出了一种估计解的可靠性的方法。数值试验表明，这类逆问题采用边界元法是非常有效的。     

电磁感应探测的灵敏度研究

本文讨论了电磁感应探测传感线圈的匝数与探测灵敏度的关系,论证了在探距确定的条件下,探测传感线圈直径的最优值。     

新的模糊似然函数

模糊似然函数是刻画两个模糊集之间相似程度的重要工具，众多学者给出了多种形式的计算方法，但由于实际问题的复杂性，有些方法在某些情况下会产生违反直觉的结论．首先就闫德勤在2001年建议的方法进行讨论，然后证明了一个引理，提出一种新的模糊似然函数，其本质是由模糊集合间l^p距离导出的贴近度．与相关公式比较，发现它们能导出相同的模糊熵，最后给出一个它在模式识别中的应用实例．     

一个门限RSA密码体制

传统的门限RSA密码体制由于都是在环Zψ（n )上进行的，而会遇到固有的困难；Zψ（n ）不是域且ψ（n）必须保密，提出了一个新的门限RSA密码体制，通过数学变换克服了以上的困难，并且对它的安全性进行了简要分析。     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

脂肪醇物理化学性质的拓扑指数法研究

借助基团体积的贡献值和分子中各原子的支化度，写出分子的距离矩阵Di，由Di构建新拓扑指数五zi=ln(λmax λmid)；同时，引进分子的结构描述符Qc、有机性无机性比值OI，用多元线性回归关联脂肪醇的-lgS。-lgKow，RI，复相关系数均在0．99以上。     

Comparison of growth stress measurements with modelling in thin iron oxide films

High temperature oxidation of metals leads to residual stresses both in the metal and in the growing oxide. In this work, the evolution of this residual stresses is theoretically predicted in the growing oxide layers. The origin of these stresses is based on a microstructural model. Using experimental results providing from the oxidation kinetics, and an analysis proposed to describe the growth strain occurring in the thin layers, a set of equations is established allowing determining the stresses evolution with oxidation time. Then, the model is compared with experimental results obtained on both α-Fe and phosphated α-Fe, oxidised at different temperatures. Numerical data are extracted from experiments either with an asymptotic formulation or with an inverse method. These two methods give good agreement with experiments and allow extracting the model parameters.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

加权二次有理Bézier插值曲线

在本文中,给定一组有序空间数据点列及每个数据点的切矢向量,利用加权二次有理Bézier曲线对数据点作插值曲线,使该曲线具有C1连续性,并且权因子只是对相应顶点曲线附近产生影响,同调整两个相邻的权因子可以调整这两个相邻顶点之间的曲线和它的控制多边形.     

The Iyengar Type Inequalities with Exact Estimations and the Chebyshev Central Algorithms of Integrals

In this paper, both low order and high order extensions of the Iyengar type inequality are obtained. Such extensions are the best possible in the same sense as that of the Iyengar inequality. hzrthermore, the Chebyshev central algorithms of integrals for some function classes and some related problems are also considered and investigated.