一种求解多维超静定问题的方法

在工程实际中,存在着大量的多维超静定问题。本文对大型刚体被弹性系留的多维超静定系统的求解问题进行了讨论并采用矩阵计算机方法成功地解决了这一问题,并给出了一个通用的FORTRAN程序。     

基于遗传算法的分布式多传感器航迹关联算法

以分布式多传感系统中的两节点序贯航迹关联方法为基础,把多节点情况下的航迹关联问题转化为多维分配问题。而多维分配问题是典型的组合优化问题,其计算量随着维数的增加而出现指数爆炸现象,进而根据遗传算法能够解决组合优化问题的能力,提出了利用遗传算法解决此多维分配问题的一种方法。仿真实验结果表明,遗传算法能够有效地求解此多维分配问题,使航迹关联具有较高的成功率。     

部分极化信号多维参数联合估计的算法

基于双平行极化敏感阵列,提出了一种部分极化信号频率,二维到达角和极化参数联合估计的算法.该算法能精确地估计出部分极化信号的多维参数,无需多维谱峰搜索,具有计算量小,参数自动配对的优点,而且也适用于含有完全极化信号的情况.另外,算法也能有效地解决信源参数兼并问题.计算机仿真结果验证了算法的有效性.     

ER2MD：一种ER模型到多维模型的转换算法

多维模型是数据仓库概念设计不可缺少的工具,将传统数据库实体关系模型直接转换到多维模型,势必在很大程度上缩短数据仓库系统的开发周期.针对数据仓库概念设计需求,在传统数据库基础上,提出一种面向多维模型的转换算法ER2MD.该算法可将满足一定条件的实体关系模型转换到多维模型,产生的多维模型符合广义多维范式,能够确保多维数据库分析计算的有效性,进而有利于物理数据库的设计.     

装备采办中一级密封招标的博弈均衡分析

针对装备采办中的一级密封招标问题，分析了招标过程中的博弈特点，给出了一维贝叶斯均衡的求解方法和解析表达式，论证了在军工企业的最优战略是选择博弈的贝叶斯均衡，军方的选择是增加竞标者的人数。然后，重点分析了招标过程中的多维博弈问题，给出了多维贝叶斯均衡的一般求解方法，并针对特定的事例进行了多维均衡分析。最后，在多维博弈的框架下对一维博弈和多维博弈的均衡结果进行比较分析，结果表明：在一级密封招标过程中，多维博弈均衡是军工企业的最优战略。     

面向部队实兵演习的作战能力多维聚合评估

针对部队实兵演习作战能力评估模型机械单一、要素不全、评估虚实数据脱节,流程上不适应导演部演习组织筹划,内容上无法区分指挥程序、指挥质量、指挥时效、战斗作风等不同评估对象的问题,提出一种体系完整、要素齐全、指标科学的多维聚合评估模型,同步设计AHP+权重+归一化的作战能力计算方法,可自动化地将不同评估对象分层加权求和、回...     

基于差分进化算法的铁磁物体磁化率优化方法

针对工程中铁磁物体磁化率难以确定的问题,以单元表面积分铁磁物体感应磁场模型为基础,利用磁场测量值建立了多维磁化率数学优化模型,并运用具有全局多维寻优能力的进化差分算法对多维磁化率数学模型进行了求解,进而确定了铁磁物体的感应磁场分布。最后,设计了空心圆筒磁测实验,实验结果表明:该方法能有效获取铁磁物质多维磁化率,还能精确计算铁磁物体的感应磁场分布。     

多维离散变换与小波的并行算法及其实现

讨论了多维 DCT和多维 DWT的并行行列算法和并行多项式变换算法 ,并用 Log P模型对算法进行了分析。在仔细分析一维和二维离散小波变换与小波包变换计算结构的基础上 ,提出了它们的并行算法。算法只需相对较少的通信时间 ;适合大规模并行机 ( MPP)和工作站或微机机群系统 ;方法也适合信号处理中的各种塔式分解过程。用 Fortran语言和 PVM编制了算法的程序。在机群系统和大规模并行机上的实验表明 ,算法是正确的且具有较高的加速比。     

基于元胞数组的多维空间在舰船方案论证设计中的应用

在分析多维空间及元胞数组的基础上,提出了将元胞数组抽象成坐标轴上的点,并以此为基础建立多维空间坐标系.使用多维空间上的离散点来表述水面舰船总体方案设计,用元胞数组来描述组成舰船子系统方案的若干功能属性.该方法将舰船方案用数字化元胞集合表示,集中了基于方案探索的优化论证设计和基于功能积木的虚拟化论证设计的优势.     

非线性评估中权重的敏感性分析

分析了非线性评估中权重的敏感性问题,给出了分析的思路和计算方法,并得出判断权重敏感的方法,定义了多维权重的敏感度,并由算例说明评价值的敏感性和权重的关系.     

Search techniques for a nonlinear multiprocessor scheduling problem

The problem of assigning computer program modules to functionally similar processors in a distributed computer network is investigated. The modules of a program must be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. This problem is formulated as a zero-one quadratic programming problem, but is more conveniently modeled as a directed acyclic search graph. The model is developed and a backward shortest path labeling algorithm is given that produces an assignment of program modules to processors. A non-backtracking branch-and-bound algorithm is described that uses a local neighborhood search at each stage of the search graph.     

并行程序调试中的环境再现技术

为解决调试并行程序碰到的第一个困难:并行程序的不确定性,文中提出了环境再现技术。文中叙述了环境再现技术的思想和实现这一技术需要的数据结构,并用CCNPASCAL语言进行了描述,最后给出了一个典型的应用例子。     

A generalized-indices transportation problem

A generalized-indices transportation problem is formulated and an algorithm is presented for its solution. The algorithm is an extension of the modi-method. A theorem on the number of independent variables in the generalized-indices transportation problem is proved. An example problem is solved for the four-indices transportation problem. A computer program has been written to solve any four-indices problem.     

The assignment of storage locations to containers for a container stack

Assigning storage locations to incoming or reshuffled containers is a fundamental problem essential to the operations efficiency of container terminals. The problem is notoriously hard for its combinatorial and dynamic nature. In this article, we minimize the number of reshuffles in assigning storage locations for incoming and reshuffled export containers. For the static problem to empty a given stack without any new container arrival, the optimum reshuffle sequence is identified by an integer program (IP). The integer program captures the evolution of stack configurations as a function of decisions and is of interest by itself. Heuristics based on the integer program are then derived. Their competitiveness in accuracy and time are established by extensive numerical runs comparing them with existing heuristics in literature and in practice as well as with extensions of the existing heuristics. Variants of the IP‐based heuristics are then applied to the dynamic problem with continual retrievals and arrivals of containers. Again, numerical runs confirm that the IP‐based heuristic is competitive. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem

In this paper we present a new formulation of the quadratic assignment problem. This is done by transforming the quadratic objective function into a linear objective function by introducing a number of new variables and constraints. The resulting problem is a 0-1 linear integer program with a highly specialized structure. This permits the use of the partitioning scheme of Benders where only the original variables need be considered. The algorithm described thus iterates between two problems. The master problem is a pure 0-1 integer program, and the subproblem is a transportation problem whose optimal solution is shown to be readily available from the master problem in closed form. Computational experience on problems available in the literature is provided.     

D运输问题在物资调度中的应用

D运输问题是含离散目标约束的目标规划问题.首先将此多目标问题转化为单一目标问题,使之简化为传统的运输问题,然后使用一种相对简单的方法求解.最后结合一个实例,讨论了D运输问题在物资调度中的应用.     

The payment scheduling problem

Large complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can be scheduled in several different ways. We assume that a known amount of cash changes hands at each event. Given any schedule the present value of all cash transactions can be calculated. The payment scheduling problem looks for a schedule that maximizes the present value of all transactions. This problem was first introduced by Russell [2]; it is a nonlinear program with linear constraints and a nonconcave objective. This paper demonstrates that the payment scheduling problem can be transformed into an equivalent linear program. The linear program has the structure of a weighted distribution problem and an efficient procedure is presented for its solution. The algorithm requires the solution of triangular systems of equations with all matrix coefficients equal to ± or 0.     

应用有限元混合法分析两弹性接触体的动力响应（理论部分）

本文将动力分析中的直接积分法与有限元混合法结合起来对两弹性接触体的摩擦动力求解问题进行了理论分析,推导了有关的有限元公式,设计了计算框图,为计算程序的实现提供了理论依据。     

Equivalent knapsack-type formulations of bounded integer linear programs: An alternative approach

In this paper we show that every bounded integer linear program can be transformed into an integer program involving one single linear constraint and upper and lower bounds on the variables, such that the solution space of the original problem coincides with that one of the equivalent knapsack-type problem.     

基于遗传算法的湿陷性黄土地基灰土挤密桩优化设计

利用Visual C＋＋语言，定义了一个面向对象的基于实数编码遗传算法类。运用可最大限度保证遗传算法搜索到问题的全局最优解的深度搜索策略，编制了灰土挤密桩的优化设计和造价估算遗传算法程序，并针对兰州某地灰土挤密桩复合地基进行了计算分析，并与原有方案比较，结果表明：两种优化方案在满足承载力和变形的条件下，在降低造价成本方面优势非常明显。