煤样的微细观裂纹损伤本构模型

基于对煤样受载变形过程中其内部微细观裂纹及变形损伤特征,通过选取合适的损伤参量,推导出单轴压缩下煤样的损伤本构模型,并得出材料常数A和n的表达式,进而解释其含义。实验结果表明实验曲线与理论曲线拟合度较高。     

具非负曲率的完备黎曼流形上核心的性质

讨论了具非负曲率的完备非紧黎曼流形上的核心的结构,证明了如果核心是惟一的,那么核心将退化为极点.     

关于Caristi不动点定理的一个推广

本文给出了Caristi不动点定理及其及相应结果的一个推广,并由此可以推广许多Banach不动点定理.     

投入产出分析的RAS方法的加权修正和推广——RTALS方法及其数学模型

确定了Ｉ／Ｏ中直耗系数变动对“全局”的影响程度因子，并把该因子作为直耗系数的权重，对ＲＡＳ法进行修正推广。提出了ＲＴＡＬＳ方法及其数学模型。     

等幂和与最大模多项式

研究了等幂和与完整三角和的最大模多项式之间的联系，并用已知的等幂和问题的结果得到一些最大模多项式．     

Almost sure convergence and complete convergence for the weighted sums of martingale differences

Let {(D _n, FFF_n),n/->1} be a sequence of martingale differences and {a _ni, 1≤i≤n,n≥1} be an array of real constants. Almost sure convergence for the row sums are discussed. We also discuss complete convergence for the moving average processes underB-valued martingale differences assumption. Foundation item: Supported by the National Natural Science Foundation of China and the Doctoral Programme Foundation of China Biography: DENG Ai-jiao (1974-), female, Ph.D. candidate. Research interest is in stochastic processes and random fractal.     

图Cm·Kn的邻强边染色

将顶点集和边集分别为V={vij┃i=1,2,…,m;j=0,1,…,n-1},E={v10v20,v20v30,…,vm0v10}U（Ui-1^m）ijvik┃j≠k,j,k=0,1,…,n-1}的图简记为Cm·Kn.利用图分解和色集置换的方法,给出了图Cm·Kn的邻强边色数。     

完全图的seidel特征多项式及其谱

设A（G）是图G的邻接矩阵,J是全1方阵,I是单位矩阵．称S（G）=J-I-2A（G）为图G的seidel矩阵,与之对应的多项式SG（λ）=｜λI—S（G）｜称为图G的seidel特征多项式．本文给出了完全图Kn的seidel特征多项式及其谱．     

完备格上交既约元的性质

根据格上交既约元、完全交既约元的概念,定义了连续交既约元,给出了它们之间的联系与区别,进而得出完备格上交既约元的一些性质及相关结论.     

Combined Timetabling Procedure and Complete Local Search for No-Wait Job Shop Scheduling with Total Tardiness

The strong non-deterministic polynomial-hard （NP-hard） character of job shop scheduling problem （JSSP） has been acknowledged widely and it becomes stronger when attaches the no-wait constraint, which widely exists in many production processes, such as chemistry process, metallurgical process. However, compared with the massive research on traditional job shop problem, little attention has been paid on the no-wait constraint. Therefore, in this paper, we have dealt with this problem by decomposing it into two sub-problems, the timetabling and sequencing problems, in traditional frame work. A new efficient combined non-order timetabling method, coordinated with objective of total tardiness, is proposed for the timetabling problems. As for the sequencing one, we have presented a modified complete local search with memory combined by crossover operator and distance counting. The entire algorithm was tested on well-known benchmark problems and compared with several existing algorithms. Computational experiments showed that our proposed algorithm performed both effectively and efficiently.