一类平面微分系统的定性分析

本文利用微分方程对称法、形式级数和旋转向量场理论,对平面微分系统ｄｘ／ｄｔ＝－ｙ＋δｘ＋ａｘｙ＋ｂｘ＾２Ｆ（ｘ）,ｄｙ／ｄｔ＝Ｇ（ｘ）进行了全面分析,得出了较完整的定性分析结果。     

强非线性系统响应的研究

讨论了如下形式ｕ＋２εηｕ＋ｕ＋ｕε＝２εｈｃｏｓ（ｔ）的强 ｄｕｆｆｉｎｇ系统,式中ｕ上方的圆点表示对时间ｔ的导数,η为系统阻尼系,ε不要求是一个小量。对系统进行了变换,用多尺度法求得了系统的二次近似解,分析了稳定性。     

关于线性规划中的循环问题研究

单纯形算法之所以是求解线性规划问题的主要的原因之一,在于它遇到的循环现象是极其罕见的。本文从Ｂ．Ｂｅａｌｅ１９９５年给出的示例入手,从理论上分析单纯形算法产生的循环的充分条件,并给出了２个实例。     

线性分式规划原始单纯形算法有限性问题

本文用一个数值例子说明用[1] 和[2] 中的原始单纯形算法求解退化的线性分式规划(LFP) 可能会出现基循环,从而得不到最优解。于是就此情形引入了Bland规则,并建立了有限性算法。     

一类两种群竞争离散系统的持久性

讨论了密度制约的两种群竞争离散系统{x（n＋1）=x（n）exp｜r1-a1x（n）-b1y（n）｜ y（n＋1）=y9n）exp｜r2-a2x（n）-b2y（n）｜的初值解的有界性及系统的持久性。通过适当构造解的最终有界区域,证明了当b1/b2〈r1/r2/〈a1/a2时,系统是强持续生存的。这里ri,ai,bi（i=1,2）均为正的常数。     

俄总设计师揭苏-35S发展秘辛

日前,俄国防部机关报《红星报》采访了苏－35S歼击机总设计师伊格尔-德明,首度披露这款“4＋＋”代战机的发展历程、设计思想转变,以及上世纪80年代惊鸿一瞥的三翼面苏－35（最初称苏－27M）、苏－30MK和今天苏－35S之间的血缘关系。     

线性规划问题新解——改进大M法

借鉴两阶段法的求解思路,在用单纯形法求解线性规划问题时,对大M法进行改进,提出一种新的算法.这种改进后的算法可以有效克服原来两种算法的不足,既能降低理解难度,又能提高算法的效率,保证算法的全局收敛性.     

CBM＋：航空维修保障新趋势

增强型基于状态的维修（CBM＋）是美国军方于本世纪初开始大力推行的一种维修方式,作为一种主动维修形式,它是航空维修的重要发展方向之一。文章通过详细介绍CBM＋方案,着重分析了CBM＋的关键技术及其对航空维修保障工作的影响,最后总结出CBM＋的应用趋势。     

一个基于面向对象模型的并行系统

为了开发分布式系统中的计算资源,我们设计了一个基于面向对象大粒度数据流模型的并行Ｃ＋＋系统ＯＯＣＰＣＳ．该系统的底层计算模型是面向对象范式和数据流模型的结合体。它将状态对象引入到数据流模型中,并且支持面向对象的特性。本文讨论了此模型在ＯＯＣＰＣＳ系统中的实现;并行化编译器;ＰＯＣ程序设计语言;面向对象网络文件Ｉ／Ｏ和虚拟ＯＯＬＧＤＦＭ机     

“又＋动1＋又＋动2”格式之考察

本文对收集到的＂又＋动1＋又＋动2＂格式的语料进行了定量、定性分析,从它的构成形式、语义特点、位序特点、语法功能四个方面概括了这一格式的特点,并比较分析了这一格式与＂又＋形1＋又＋形2＂格式的相同点和不同点,以及与其它并列格式的区别。以期对＂又A又B＂格式的特点有个更全面、准确地把握。     

A comparison of the primal-simplex and complementary pivot methods for linear programming

A comparison of the complementary pivot method of Lemke-Howson and the more commonly used primal-simplex method for solving linear programming problems in symmetric dual form has been made. In our tests the complementary pivot method shows a definite superiority over the simplex method both with regard to the number of iterations and computation time.     

目标规划的求解

目标规划的求解可采用图示法、单纯形法、分级法等,文中用Excel演示单纯形法和分级法。     

The simplex method for integral multicommodity networks

The simplex method is interpreted as a labeling procedure for certain classes of multicommodity flow problems in a manner similar to that for single commodity networks. As opposed to general multicommodity algorithms, no explicit matrix inversion is required; all simplex operations are performed graph-theoretically.     

An approximative algorithm for the fixed charge problem

This paper describes an approximate solution method for solving the fixed charge problem. This heuristic approach is applied to a set of test problems to explore the margin of error. The results indicate that the proposed fixed charge simplex algorithm is capable of finding optimal or near optimal solutions to moderate sized fixed charge problems. In the absence of an exact method, this heuristic should prove useful in solving this fundamental nonlinear programming problem.     

A primal simplex algorithm to solve a rectilinear distance facility location problem

This paper considers the problem of locating m new facilities in the plane so as to minimize a weighted rectangular distance between the new facilities and n existing facilities. A special purpose primal simplex algorithm is developed to solve this problem. The algorithm will maintain at all times a basis of dimension m by m; however, because of the triangularity of the basis matrix, it will not be necessary to form a basis inverse explicitly.     

伺服系统直流调速系统的改进型内模PD-I控制方法

为提高直流调速系统的控制性能,提出了一种改进型内模PD-I控制器的设计方法。根据直流电机的运行原理,建立了电机输出转速与输入电压变化率之间的数学模型,基于内模控制(Internal Model Control,IMC)原理和Taylor级数展开,设计了一种内模PD控制器,且可通过选择系统的截止频率实现控制器参数的整定。为了获得系统调节所需的控制作用,可将内模PD控制器与积分环节相串联构成改进型内模PD-I控制器,仿真和实验结果表明本方法可使系统获得更好的控制性能。     

An M/M/1 queue with a general bulk service rule

A model of an M/M/1, bulk queue with service rates dependent on the batch size is developed. The operational policy is to commence service when at least L customers are available with a maximum batch size of K. Arriving customers are not allowed to join in-process service. The solution procedure utilizes the matrix geometric methodology and reduces to obtaining the inverse of a square matrix of dimension K + 1 - L. For the case where the service rates are not batch size dependent, the limiting probabilities can be written in closed form. A numerical example illustrates the variability of the system cost as a function of the minimum batch service size L.     

A forward network simplex algorithm for solving multiperiod network flow problems

An optimization model which is frequently used to assist decision makers in the areas of resource scheduling, planning, and distribution is the minimum cost multiperiod network flow problem. This model describes network structure decision-making problems over time. Such problems arise in the areas of production/distribution systems, economic planning, communication systems, material handling systems, traffic systems, railway systems, building evacuation systems, energy systems, as well as in many others. Although existing network solution techniques are efficient, there are still limitations to the size of problems that can be solved. To date, only a few researchers have taken the multiperiod structure into consideration in devising efficient solution methods. Standard network codes are usually used because of their availability and perceived efficiency. In this paper we discuss the development, implementation, and computational testing of a new technique, the forward network simplex method, for solving linear, minimum cost, multiperiod network flow problems. The forward network simplex method is a forward algorithm which exploits the natural decomposition of multiperiod network problems by limiting its pivoting activity. A forward algorithm is an approach to solving dynamic problems by solving successively longer finite subproblems, terminating when a stopping rule can be invoked or a decision horizon found. Such procedures are available for a large number of special structure models. Here we describe the specialization of the forward simplex method of Aronson, Morton, and Thompson to solving multiperiod network network flow problems. Computational results indicate that both the solution time and pivot count are linear in the number of periods. For standard network optimization codes, which do not exploit the multiperiod structure, the pivot count is linear in the number of periods; however, the solution time is quadratic.     

Computing bounds for the optimal value in linear programming

Consider a standard linear programming problem and suppose that there are bounds available for the decision variables such that those bounds are not violated at an optimal solution of the problem (but they may be violated at some other feasible solutions of the problem). Thus, these bounds may not appear explicitly in the problem, but rather they may have been derived from some prior knowledge about an optimal solution or from the explicit constraints of the problem. In this paper, the bounds on variables are used to compute bounds on the optimal value when the problem is being solved by the simplex method. The latter bounds may then be used as a termination criteria for the simples iterations for the purpose of finding a “sufficiently good” near optimal solution. The bounds proposed are such that the computational effort in evaluating them is insignificant compared to that involved in the simplex iterations. A numerical example is given to demonstrate their performance.     

把逻辑植根于辩证唯物论基础之上——从起源、目的、研究方式、作用看逻辑的本质

按照辩证唯物论的观点,形式和内容是不可分离的.逻辑在本质上只是以形式的方法研究内容--对象间的最一般关系,绝非纯形式.逻辑的起源、目的、研究方式和作用充分证明了这一点.把握这一点,可以把逻辑与经验知识及真理恰切地沟通起来,对推进逻辑学的研究与发展有重要意义.