耦合的Fitz-Hugh-Nagumo模型的初边值问题

首先研究了具有耦合的Ｆｉｔｚ－Ｈｕｇｈ－Ｎａｇｕｍｏ模型初值问题的渐近性．其次，所对应的平衡态方程 解的基本性态也将被讨论．最后，该模型的初边值问题古典解的最大吸引子的存在性将首次被证明．     

数学年刊第21卷B辑第2期(2000)目次和提要

非牛顿流的Ｏｌｄｒｏｙｄ 模型的整体解 Ｐ． Ｌ． Ｌｉｏｎｓ Ｎ． Ｍａｓｍｏｕｄｉ 考虑由不可压的Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程和迁移方程之间强耦合所组成的非牛顿流的Ｏｌｄｒｏｙｄ模型，证明了对于一般的初始条件存在的整体弱解，存在性的证明依赖于证明解的紧致性的时间传播． 非线性弹性板的单向特征值问题：通过伪单调算子的近似法 Ｌ． Ｇｒａｔｉｅ 考虑在部分边界上施压和放在平的刚性支撑上的Ｖｏｎ Ｋａｒｍａｎ板的弯曲模型的一类变分不等式．Ｄ．Ｇｏｅｌｅｖｅｎ， Ｖ． Ｈ． Ｎｇｕｙｅｎ和Ｍ．Ｔｈｅｒａ的存在性…     

多重经济增长路径,多重稳态解和分歧

该文给出一个具有可解内生生育率的Cass-Koopmans（C-K）经济增长模型．证明参数满足时，模型存在多重经济增长路径和多重稳态解；当时，经济增长路径和稳态解唯一，即描述模型的微分动力系统出现分歧．文中讨论了多重经济增长路径的几何形态、位置关系和主要结果的经济意义．     

空竭服务Geom/G/1休假模型

本文用嵌入Markov链的方法证明了Geom／G／1的边界状态变体模型的随机分解定理，同时又证明两种具体模型的结果．     

一类广义Swift-Hohenberg模型方程的时间周期问题

本文研究一类广义Swift-Hohenberg模型方程的时间周期问题，证明问题周期广义解和周期古典解的存在性与唯一性．     

最小二乘法在地基土工参数获取中的应用

本文利用最小二乘的L-M方法建立了关于地基土工参数的优化计算模型,并基于MATLAB得出计算结果．从而证明利用最小二乘法可有效地获取土工参数．     

项目投资组合的风险度及其最优决策

本文针对项目组合投资问题引入了风险度概念，并建立其风险度模型．在无零风险度项目的情况下，给出了该模型的最优项目组合投资策略并证明该策略为马氏有效．在有零风险度项目的情况下，讨论了该模型的有效前沿的结构、性质和有效性，同时还论证了该模型的有效前沿与威廉·夏普提出的资本资产定价模型的有效前沿相一致的线性关系．最后作为本模型的应用，构造了”保证还本”模型，给出了其最优项目投资组合的策略．     

有关判断决策单元的DEA有效性的新方法的探讨

为了判断决策单元是否(弱)DEA有效并克服现有的模型及[1]中模型在解决上述问题时的不足之处,本文将讨论的新模型是由CCR模型与CCGSS模型变来的,且定理的证明不同于[1]．还讨论了文中新模型的最优解的存在性,此外,研究了所有决策单元的输入输出的变化对某决策单元有效性的影响．     

具有比例摩擦金融市场的一般经济均衡与资产定价(英文)

本文建立具有比例摩擦金融市场的简单两时期模型．经济人具有均值－方差偏好,并且在交易金融资产的过程中支付交易费用．本文证明了两种金融资产的一般经济均衡与资产定价的基本估值公式．     

劳动力供给带弹性的Solow模型

本文给出了在劳动力供给带弹性条件下的Ｓｏ１ｏｗ增长模型，给出了经济增长的黄金律和均衡处资本稳定性的证明，并且与不带弹性的Ｓｏｌｏｗ模型作了比较．     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

Chaotic synchronization with filter based on wavelet transformation

A kind of chaotic synchronization method is presented in the paper. In the transmitter, part signals are transformed by wavelet and the detail information is removed. In the receiver, the component with low frequency is reconstructed and discrete feedback is used, we show that synchronization of two identical structure chaotic systems is attained. The effect of feedback on chaotic synchronization is discussed. Using the synchronous method, the transmitting signal is transported in compressible way, system resource is saved, the component with high frequency is filtered and the effect of disturbance on synchronization is reduced. The synchronization method is illustrated by numerical simulation experiment.     

Logic optimality for multi-objective optimization

Pareto dominance is one of the most basic concepts in multi-objective optimization. However, it is inefficient when the number of objectives is large because in this case it leads to an unmanageable number of Pareto solutions. In order to solve this problem, a new concept of logic dominance is defined by considering the number of improved objectives and the quantity of improvement simultaneously, where probabilistic logic is applied to measure the quantity of improvement. Based on logic dominance, the corresponding logic nondominated solution is defined as a feasible solution which is not dominated by other ones based on this new relationship, and it is proved that each logic nondominated solution is also a Pareto solution. Essentially, logic dominance is an extension of Pareto dominance. Since there are already several extensions for Pareto dominance, some comparisons are given in terms of numerical examples, which indicates that logic dominance is more efficient. As an application of logic dominance, a house choice problem with five objectives is considered.     

不确定条件下双目标组批生产的交货期设置研究

交货期是调度方法的函数,因而具有不确定性.研究变批量、变批次、变生产能力下,单阶段、双目标有条件相容组批的交货期设置问题,将它转化为订单投放策略和调度模式研究.建立了一个基于目标的双目标订单投放策略数学模型.采用目标序列优先方法进行双目标求解,用两种调度模式求出区间值,进行最优交货期逼近.模式1:松弛掉产品加工约束条件,基于负荷考虑、给出离散生产模式下订单完工率最大的订单排序算法,算法综合考虑了任务紧急程度、可调度性、重要度和流程时间最短四个方面,得到区间的一个端点.模式2是有条件相容的启发式组批调度算法,即通过聚类计算将订单安排问题转化为多队列调度问题,将新来订单的投放转化为某个队列的插单和批量分割问题,不同队列中批的投产顺序由批中优先级最高的订单决定,并在能力约束下进行批量分割计算,得到区间的另一个端点,结合流程可靠性求出区间.实例证明,模式2的交货期设置小,订单完工率和生产率高.     

Borel measures in consonant spaces

A topology on a set X is called consonant if the Scott topology of the lattice is compactly generated; equivalently, if the upper Kuratowski topology and the co-compact topology on closed sets of X coincide. It is proved that every completely regular consonant space is a Prohorov space, and that every first countable regular consonant space is hereditarily Baire. If X is metrizable separable and co-analytic, then X is consonant if and only if X is Polish. Finally, we prove that every pseudocompact topological group which is consonant is compact. Several problems of Dolecki, Greco and Lechicki, of Nogura and Shakmatov, are solved.     

油田注水系统拓扑布局优化的混合遗传算法

以投资最小为目标函数,建立了注水系统拓扑布局优化数学模型.根据模型特点,将优化问题分为两层,分别采用遗传算法和非线性优化方法进行求解.并对遗传算法的操作过程进行了改进,调整了适应函数,改进了交叉和变异操作,结合了模拟退火算法,在操作过程中使约束条件得到满足,减少了不可行解的产生,使遗传算法的优化性能得到了提高.优化算例说明了该方法的有效性.     

An analysis of a ‘Sunday Supplement’ problem

A problem posed in an influential textbook is analysed in more detail than is given there. The textbook answer to the problem has been represented as counterintuitive, as is probably the case; however, it is here shown that it depends critically on an assumption. If this is relaxed, then a wide variety of possible answers is available. All the same, if the special assumption made is replaced by one of a number of more realistic ones, then the order of magnitude of the approximation given by the author of the textbook is preserved.     

最小填充问题的可分解性

起源于稀疏矩阵计算和其它应用领域的图G的最小填充问题是在图G中寻求一个内含边数最小的边集F使得G F是弦图.这里最小值|F|称为图G的填充数,表示为f(G).作为NP-困难问题,该问题的降维性质已被研究,其中包括它的可分解性.基本的可分解定理是:如果图G的一个点割集S是一个团,则G经由S是可分解的.作为推广,如果S是一个"近似"团(即只有极少数边丢失的团),则G经由S是可分解的.本文首先给出基本分解定理的另外一个推广:如果S是G的一个极小点割集且G-S含有至少|S|个分支,则G经由S是可分解的;其次,给出了这个新推广定理的一些应用.     

Method of dual matrices for function minimization

In this paper, the method of dual matrices for the minimization of functions is introduced. The method, which is developed on the model of a quadratic function, is characterized by two matrices at each iteration. One matrix is such that a linearly independent set of directions can be generated, regardless of the stepsize employed. The other matrix is such that, at the point where the first matrix fails to yield a gradient linearly independent of all the previous gradients, it generates a displacement leading to the minimal point. Thus, the one-dimensional search is bypassed. For a quadratic function, it is proved that the minimal point is obtained in at mostn + 1 iterations, wheren is the number of variables in the function. Since the one-dimensional search is not needed, the total number of gradient evaluations for convergence is at mostn + 2.Three algorithms of the method are presented. A reverse algorithm, which permits the use of only one matrix, is also given. Considerations pertaining to the applications of this method to the minimization of a quadratic function and a nonquadratic function are given. It is believed that, since the one-dimensional search can be bypassed, a considerable amount of computational saving can be achieved.This paper, supported by the National Science Foundation, Grant No. GP-32453, is based on Ref. 1.     

覆盖下近似算子的拓扑性质

在不限制U为有限论域的情况下,研究了覆盖下近似算子XL和CL的拓扑性质。证明了覆盖下近似算子XL是内部算子,而且由XL生成的拓扑TXL为包含由覆盖C本身作为子基生成的拓扑TC的最小Alexandrov拓扑。特别地,当U为有限论域时,TXL=TC.然而,覆盖下近似算子CL不是内部算子。当覆盖C为某拓扑的基时,CL是内部算子,且此时由CL生成的拓扑TCL与TC是同一个拓扑。若进一步要求U为有限论域,则TCL=TXL=TC,进而CL=XL.