排序方式: 共有69条查询结果,搜索用时 31 毫秒
11.
本文应用有限元分析了SG高压水室在典型负荷波动下的热应力,根据所计算出的峰值应力循环幅,引用低周疲劳设计曲线,对结构的低周疲劳用ASME规范进行了评估,发现SG在典型载荷循环下不产生显著的低周疲劳损伤。 相似文献
12.
软件无失效测试数据的统计分析 总被引:2,自引:0,他引:2
张志华 《海军工程大学学报》2003,15(6):21-24
软件可靠性估计是软件可靠性研究的重要问题之一,文中对分布式软件系统可靠性的评估方法进行了研究,给出了软件系统可靠度的最优置信下限.最后以某大型软件的评估为例,说明该方法的应用. 相似文献
13.
14.
We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
15.
针对有限数量机载雷达目标覆盖价值问题,建立了机载雷达载机待选轨道中心点(COCP)概念;分析了COCP和目标点之间的关系,给出了有限数量机载雷达目标覆盖价值问题的数学模型。通过分析有限规模COCP集合的方法,建立了多个机载雷达部署约束条件的数学模型。通过对COCP集合和目标点集合进行约束排除和聚类,简化了研究问题。总结出了有限数量机载雷达目标覆盖价值数学模型的最优解和启发式次优解,实例仿真结果表明该模型和算法的有效性。 相似文献
16.
提出一种基于双幂次组合函数趋近律的新型滑模控制方案。与现有的快速幂次或双幂次趋近律相比,具有更快的收敛速度,同时还保持了全局固定时间收敛特性,收敛时间上界与滑模初值无关。当系统存在有界扰动时,能够使滑模变量在有限时间内收敛到稳态误差界内,同时其稳态误差要小于现有方法的。仿真实验验证了该方法的有效性及理论分析的正确性。 相似文献
17.
In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
18.
上、下半连续性在数学中的重要性不言而喻,在微观经济分析中也有着广泛应用,特别是静态优化问题。分别在单值映射、集值映射中探讨了上半连续性和下半连续性的关系。先证明了单值映射上、下半连续性等价的结论(定理1),并利用引理1对常见函数的上、下半连续性进行了探讨以进一步说明定理1;然后通过举反例进行论证,得出了集值映射中上、下半连续性不等价的结论(定理2);最后例举了上、下半连续性在数理经济上的应用,具有创新价值。通过对数理经济学中参数约束最优化问题的最大值定理(引理2)条件和结论所做的两点注记,并附以具体实例予以解释,说明了单、集值映射中上、下半连续性的关系,以及在数理经济上的重要应用。 相似文献
19.
Harold P. Benson 《海军后勤学研究》2006,53(4):309-317
The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
20.
In this paper we present an improved branch and bound algorithm for the vertex coloring problem. The idea is to try to extend the coloring of a maximum clique to its adjacent vertices. If this succeeds, its successive neighbors are considered; in case of failure (i.e., in the case the initial colors are not sufficient), working on the subgraph induced by the maximum clique and its neighborhood, the lower bound is improved by seeking for an optimal coloring of this subgraph by branch and bound. The process is repeated iteratively until the whole graph is examined. The iterative scheme exploits a further lower bound obtained by integrating a simple algorithm into the maximum clique search, and a new method to compute upper bounds on subgraphs. Furthermore, a new branching rule and a method for the selection of the initial maximum clique are presented. Extensive computational results and comparisons with existing exact coloring algorithms on random graphs and benchmarks are given. © 2001 John Wiley & Sons, Inc. Naval Research Logistic 48: 518–550, 2001 相似文献