共查询到20条相似文献,搜索用时 74 毫秒
1.
阐述了武器装备设计定型试验标准化的主要任务和工作内容,分析了设计定型试验标准化工作存在的主要问题,提出了加强设计定型试验标准化工作的措施建议。 相似文献
2.
3.
4.
5.
6.
7.
随着现代设计制造技术难度不断增加,对新型装备进行设计定型试验的任务量和复杂程度日益提高,试验中所涉及因素也越来越多。文章从总体设计角度出发,将设计定型试验大纲纳入型号研制工作过程之中,并对样机试验的内容、任务量、测试参数、技术状态,以及关键技术、试验保障、试验支持等问题进行分析,为提前安排设计定型试验和部队使用试验提供参考。 相似文献
8.
从国内外战术导弹靶场定型鉴定中仿真与飞行试验一体化研究现状分析出发,针对战术导弹定型鉴定中飞行试验受各种条件限制,且试验数量有限的问题,提出了仿真试验与飞行试验一体化的方案构想,包括一体化试验设计、评估和管理等,分析了一体化试验关键技术,并结合实例说明仿真与飞行试验一体化的具体应用. 相似文献
9.
10.
11.
李强 《兵团教育学院学报》2012,(4):82-84
中学数学教学中,解数学难题的过程就是从题设中不断地挖掘并利用隐含条件进行推理和变形的过程。数学题中的隐含条件形形色色,花样繁多,但从对解题过程的影响看,又可以分为制约解题方向的隐含条件、制约解题思路的隐含条件、制约解题准确性的隐含条件等三类隐含条件。只要我们把握了难题中隐含条件的规律特征,运用我们获得的数学知识,结合适当的数学思想和数学方法,就可以轻松解决难题了。 相似文献
12.
分析了由模型到仿真程序的问题的基本原因,指出了模型校核的必要性。对模型校核中的稳定性问题、系统状态不连贯问题和代数环问题进行了阐述和分析。针对一个二阶线性连续系统模型的离散化,通过模型校核,发现了隐含其中的稳定性问题,进而指出了相关稳定性理论在应用上的局限性,给出了解决此稳定性问题的方法,并最终通过模型校核,确认了该解决方法的有效,从而保证了对该二阶连续系统的精确的离散化。 相似文献
13.
分析了目前云计算服务中存在的应用风险和安全隐患,并将其抽象为两方面的问题,即安全边界问题和用户服务资源映射问题。为了解决这两个方面的问题,根据云计算系统的实际需求,给出云计算服务的一种普适性的定义;在此定义基础上,提出了云计算服务的安全框架,并设计了云计算服务各层协议集合。在这个框架和协议集合下,分析了保证云计算服务正常执行所需的四方面要素,以及将诸要素较好地整合在一起的方法。 相似文献
14.
考虑了二阶线性系统的比例微分(PD)反馈特征结构配置问题以及其在最优控制问题中的应用。基于比例微分特征结构配置参数化方法,将二阶线性系统的最优控制问题转化为一个便于求解的有约束条件的极小值问题,并给出了相应的求解算法。三自由度质量弹簧阻尼系统算例及其仿真结果表明所提算法简单、有效。 相似文献
15.
Mary W. Cooper 《海军后勤学研究》1981,28(2):301-307
An algorithm is presented to gain postoptimality data about the family of nonlinear pure integer programming problems in which the objective function and constraints remain the same except for changes in the right-hand side of the constraints. It is possible to solve such families of problems simultaneously to give a global optimum for each problem in the family, with additional problems solved in under 2 CPU seconds. This represents a small fraction of the time necessary to solve each problem individually. 相似文献
16.
This paper studies the one-period, general network distribution problem with linear costs. The approach is to decompose the problem into a transportation problem that represents a stocking decision, and into decoupled newsboy problems that represent the realization of demand with the usual associated holding and shortage costs. This approach leads to a characterization of optimal policies in terms of the dual of the transportation problem. This method is not directly suitable for the solution for large problems, but the exact solution for small problems can be obtained. For the numerical solutions of large problems, the problem has been formulated as a linear program with column generation. This latter approach is quite robust in the sense that it is easily extended to incorporate capacity constraints and the multiproduct case. 相似文献
17.
An important class of network flow problems is that class for which the objective is to minimize the cost of the most expensive unit of flow while obtaining a desired total flow through the network. Two special cases of this problem have been solved, namely, the bottleneck assignment problem and time-minimizing transportation problem. This paper addresses the more general case which we shall refer to as the time-minimizing network flow problem. Associated with each arc is an arc capacity (static) and a transferral time. The objective is to find a maximal flow for which the length (in time) of the longest path carrying flow is minimized. The character of the problem is discussed and a solution algorithm is presented. 相似文献
18.
图论最短路径问题在消防选址中的应用 总被引:1,自引:0,他引:1
姬东 《中国人民武装警察部队学院学报》2009,25(12):10-12
最短路径问题是图论解决的典型实际问题之一,可用来解决管路铺设、线路安装、厂区布局和设备更新等实际问题。介绍了图论最短路径问题及其算法,并应用图论最短路径问题的分析方法,解决城市消防站的选址问题。 相似文献
19.
We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003. 相似文献
20.
运载火箭最优上升轨道设计问题是一类终端时刻未定、终端约束苛刻的最优控制问题,经典算法求解这类问题时收敛性差、局部收敛等问题表现得比较突出。针对上述问题,将具有良好全局收敛性的遗传算法应用到运载火箭最优上升段设计问题求解中,为了提高遗传算法的收敛速度和克服早熟问题,结合遗传算法和单纯型算法的优点,设计了两种混合遗传算法。计算结果表明,所设计的混合遗传算法是求解复杂问题的有效全局优化方法,可以成功地解决一类终端时刻可变飞行器最优控制问题。 相似文献