排序方式: 共有174条查询结果,搜索用时 15 毫秒
31.
32.
33.
34.
地空导弹阵地优选的灰色关联模型研究 总被引:1,自引:0,他引:1
依据地空导弹阵地优选受多因素制约的特点,运用灰色关联分析建立地空导弹阵地优选的灰色关联模型。通过综合研究地空导弹阵地选择的战术、技术要求及影响因素,提出了阵地选择的指标体系,进而结合使用Delphi法,建立了地空导弹阵地优选的灰色关联模型。经过实例计算证明了该模型具有实用性和推广价值。 相似文献
35.
基于视觉的机动车辆自动识别方法工程量小、检测范围大、系统安装相对灵活,是一种很有前途的方法。目前已开发的商业系统大都用在日间辅助交通管理上。为改善视觉交通检测系统的实用性和增强系统的功能,本文作者对模型系统进行了深入的理论研究,提出了2.5维图像的新思路,提取车辆外形的综和特征更为准确,自适应识别方案使车型识别准确灵活,车头颜色特征的利用使识别的准确性进一步提高。实验证明,系统对光线的适应能力也明显增强,系统的稳定性得到改善,有望扩大系统的使用范围。 相似文献
36.
为评价参数模型的优劣,分析了模型信息量与数据被模型拟合后的残差信息量之间的关系,提出了综合考虑模型拟合残差大小、残差信息量与参数数目的一种模型选择的新方法RIA。结合RIA方法,定义了时序模型评价的一种准则,并以航天测量数据处理为例,说明了不同模型在工程实际中的不同表现和本质区别的意义所在。 相似文献
37.
针对无线移动通信网络的客观制约,给出了一种音频同步的基于视频连环画模式摘要自动生成的实用视频服务方案,使得系统在向用户提交连续音频流的同时,能够随着网络带宽条件的变化,按照动态采样频率,基于视频内容选择重要帧递送,并按照与音轨同步的模式播放,从而在降低数据量的同时,满足用户对视频内容综合理解的需求。 相似文献
38.
Consider a simulation experiment consisting of v independent vector replications across k systems, where in any given replication one system is selected as the best performer (i.e., it wins). Each system has an unknown constant probability of winning in any replication and the numbers of wins for the individual systems follow a multinomial distribution. The classical multinomial selection procedure of Bechhofer, Elmaghraby, and Morse (Procedure BEM) prescribes a minimum number of replications, denoted as v*, so that the probability of correctly selecting the true best system (PCS) meets or exceeds a prespecified probability. Assuming that larger is better, Procedure BEM selects as best the system having the largest value of the performance measure in more replications than any other system. We use these same v* replications across k systems to form (v*)k pseudoreplications that contain one observation from each system, and develop Procedure AVC (All Vector Comparisons) to achieve a higher PCS than with Procedure BEM. For specific small-sample cases and via a large-sample approximation we show that the PCS with Procedure AVC exceeds the PCS with Procedure BEM. We also show that with Procedure AVC we achieve a given PCS with a smaller v than the v* required with Procedure BEM. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 459–482, 1998 相似文献
39.
Reliability data obtained from life tests and degradation tests have been extensively used for purposes such as estimating product reliability and predicting warranty costs. When there is more than one candidate model, an important task is to discriminate between the models. In the literature, the model discrimination was often treated as a hypothesis test and a pairwise model discrimination procedure was carried out. Because the null distribution of the test statistic is unavailable in most cases, the large sample approximation and the bootstrap were frequently used to find the acceptance region of the test. Although these two methods are asymptotically accurate, their performance in terms of size and power is not satisfactory in small sample size. To enhance the small‐sample performance, we propose a new method to approximate the null distribution, which builds on the idea of generalized pivots. Conventionally, the generalized pivots were often used for interval estimation of a certain parameter or function of parameters in presence of nuisance parameters. In this study, we further extend the idea of generalized pivots to find the acceptance region of the model discrimination test. Through extensive simulations, we show that the proposed method performs better than the existing methods in discriminating between two lifetime distributions or two degradation models over a wide range of sample sizes. Two real examples are used to illustrate the proposed methods. 相似文献
40.
Consider a supplier offering a product to several potential demand sources, each with a unique revenue, size, and probability that it will materialize. Given a long procurement lead time, the supplier must choose the orders to pursue and the total quantity to procure prior to the selling season. We model this as a selective newsvendor problem of maximizing profits where the total (random) demand is given by the set of pursued orders. Given that the dimensionality of a mixed‐integer linear programming formulation of the problem increases exponentially with the number of potential orders, we develop both a tailored exact algorithm based on the L‐shaped method for two‐stage stochastic programming as well as a heuristic method. We also extend our solution approach to account for piecewise‐linear cost and revenue functions as well as a multiperiod setting. Extensive experimentation indicates that our exact approach rapidly finds optimal solutions with three times as many orders as a state‐of‐the‐art commercial solver. In addition, our heuristic approach provides average gaps of less than 1% for the largest problems that can be solved exactly. Observing that the gaps decrease as problem size grows, we expect the heuristic approach to work well for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献