排序方式: 共有34条查询结果,搜索用时 203 毫秒
1.
张金槐 《国防科技大学学报》1998,20(3):1-4
文中给出了谱估计的分析,并将它直接应用于仿真系统输出量的特性分析。对于仿真的可信性问题,讨论了相容性检验方法,特别是小子样现场试验下,仿真与现场试验之间的一致性问题。 相似文献
2.
软件分域测试可靠性评估的注记 总被引:2,自引:0,他引:2
张志华 《海军工程大学学报》2002,14(6):35-39
软件可靠性评估是软件可靠性研究的重要问题.文中通过反例证明了分域测试的Thayer Lipow Nel son评估方法是不正确的,将样本点排序法用于分域产生可靠性评估,获得了软件可靠性置信下限.最后给出一个实例说明该方法的可行性. 相似文献
3.
We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested. 相似文献
4.
船舶航向非线性系统离散变结构控制 总被引:1,自引:0,他引:1
基于非线性模型研究船舶航向自动舵的离散变结构控制设计问题。通过状态反馈精确线性化方法设计了二次型最优滑模面,采用离散趋近律方法求得变结构控制律。研究结果表明,所设计的离散变结构控制器能够快速准确地跟踪设定航向,并对参数摄动和外界风浪干扰具有很强的鲁棒性。 相似文献
5.
为了完善基于置信区间的仿真信号一致性分析方法,考虑了置信区间与接收区间的长度匹配问题,定义来最佳样本容量,并在此基础上提出了基于D-S证据理论的仿真信号模糊一致性分析方法。同时为了对信号仿真模型的风险进行定量评估,建立了信号仿真模型风险系数函数,得到多参数仿真信号风险系数向量,以此给决策者和/或仿真用户提供决策支持。最后,用水中兵器仿真试验中水中目标辐射噪声仿真的应用实例加以说明。 相似文献
6.
A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem. 相似文献
7.
Linxiong Li 《海军后勤学研究》1999,46(1):119-127
The point availability of a one‐unit system at a specified time is defined as the probability that the component is operating at that time. When both operating time and repair time are subject to random (right) censorship, we propose an asymptotic nonparametric approach for constructing confidence intervals for the point availability of the system. The technique is based on the fact that a product limit estimator converges to a Gaussian process. The method is also extended to finding confidence intervals for the point availability of a complex system using the δ‐Method. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 119–127, 1999 相似文献
8.
This paper studies a new steady‐state simulation output analysis method called replicated batch means in which a small number of replications are conducted and the observations in these replications are grouped into batches. This paper also introduces and compares methods for selecting the initial state of each replication. More specifically, we show that confidence intervals constructed by the replicated batch means method are valid for large batch sizes and derive expressions for the expected values and variances of the steady‐state mean and variance estimators for stationary processes and large sample sizes. We then use these expressions, analytical examples, and numerical experiments to compare the replicated batch means method with the standard batch means and multiple replications methods. The numerical results, which are obtained from an AR(1) process and a small, nearly‐decomposable Markov chain, show that the multiple replications method often gives confidence intervals with poorer coverage than the standard and replicated batch means methods and that the replicated batch means method, implemented with good choices of initialization method and number of replications, provides confidence interval coverages that range from being comparable with to being noticeably better than coverages obtained by the standard batch means method. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
9.
10.
This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time‐constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 75–89, 1999 相似文献