具有Logistic增长项的两种群竞争Keller-Segel模型的稳定性分析

应用线性化方法研究两种群竞争的Keller-Segel模型常数平衡解的个数及其稳定性问题.     

A Forward Selection Method on Customer Credit

In this paper, we discuss a selection and evaluation method of customer credit for the commercial bank loans operation, and put forth a forward selection model by optimization techniques. At last, we also give an example to analyze its application.     

粉末冶金陶瓷模工艺中的快速脱蜡新技术

粉末冶金陶瓷模工艺是一种先进的过净形成形工艺．本文报道该工艺中一种新的脱蜡技术．采用快速加热、管径集中热量和定向导热传热综合方法，在陶瓷模和大部分蜡模材料处于较低温度下，使蜡模材料来不及发生显著的热膨胀而直接蒸发，得到脱蜡干净、外形完整的陶瓷模．     

林肯羊与陕北地方绵羊杂交后代产肉性能研究

林肯羊和陕北地方土种绵羊杂交后代,不但能提高当地绵羊的产毛量和羊毛品质,而且能显著地提高产肉量和肉品质,经济效益十分显著。     

潮流计算中的数学方法——牛顿—拉夫逊法

本文介绍了一种解非线性代数方程组的数学方法——牛顿-拉夫逊法,并将其应用于电力系统潮流计算中。采用本文方法的计算结果表明该教学方法在电力系统潮流问题中是收敛的;同时计算结果与电力专业软件的计算结果保持了一致,从而验证了结果的正确性。     

Homology Priority Task Scheduling in μC/OS-Ⅱ Real-Time Kernel

μC/OS-Ⅱ is an open source real-time kernel adopting priority preemptive schedule strategy. Aiming at the problem of μC/OS-Ⅱ failing to support homology priority tasks scheduling, an approach for solution is proposed. The basic idea is adding round-robin scheduling strategy in its original scheduler in order to schedule homology priority tasks through time slice roundrobin. Implementation approach is given in detail. Firstly, the Task Control Block （TCB） is extended. And then, a new priority index table is created, in which each index pointer points to a set of homology priority tasks. Eventually, on the basis of reconstructing μC/OS-Ⅱ real-time kernel, task scheduling module is rewritten. Otherwise, schedulability of homology task supported by modified kernel had been analyzed, and deadline formula of created homology tasks is given. By theoretical analysis and experiment verification, the modified kernel can support homology priority tasks scheduling, meanwhile, it also remains preemptive property of original μC/OS-Ⅱ.     

足球裁判员控制比赛气氛的探讨

足球裁判员有效地控制比赛气氛是圆满完成裁判工作的重要课题,我们对比赛气氛的变化规律进行分析研究后,制订的控制对策与方法经临场实践取得了较好的效果.     

处理优化约束条件的微分方程法

在文[1]中,作者曾提出求解一般约束优化问题的一种新方法。本文利用微分方程对约束条件做进一步的讨论,证明了从一可行点的某邻域出发的该微分方程组的解关于部分变元总收敛到问题(1.1)的可行点。