排序方式: 共有88条查询结果,搜索用时 15 毫秒
21.
蔡洪 《国防科技大学学报》1996,18(3):29-34
本文研究再入弹道参数的自适应估计。所采用的方法对动力学模型噪声的未知统计特性进行补偿,并对状态参数与测量设备的系统误差交叉进行估计。仿真结果表明,无论是状态参数的估计还是测量系统误差的估计,都具有较高的精度。 相似文献
22.
蔡章生 《海军工程大学学报》1997,(4)
采用去耦合法,在未作任何假定的条件下,导出了一个新的点堆中子密度方程.该方程与老的中子密度方程相比,其精度和应用范围都有很大的提高. 相似文献
23.
24.
在导弹飞行试验中,遥外测数据是进行精度和可靠性分析的依据。通常假定外测误差服从零均值正态分布,而在实际测量中,外测参数有可能带有系统误差,它的存在对飞行轨道和落点信息的获取都具有不利的影响。在一定的模型假设下,本文获得了外测系统误差的估计,并对一些仿真结果进行了初步分析。 相似文献
25.
本文在基本的像素处理算法的基础上,提出了一种基于查找表的快速平滑插值算法。该算法不仅运算量小、精度较高,而且易于硬件实现,适合于高速显示处理系统中。 相似文献
26.
We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998 相似文献
27.
Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2⌊(n−1)/2⌋ optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2⌊(n−1)/2⌋ sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999 相似文献
28.
We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time of each job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objective is to minimize the expected sum of squared deviations of job completion times from the due date. Two versions of the problem are addressed. In the first one the due date is a given constant, whereas in the second one the due date is a decision variable. In each case, a general form of the deterministic equivalent of the stochastic scheduling problem is obtained when the counting process related to the machine uptime distribution is a generalized Poisson process. A sufficient condition is derived under which optimal sequences are V-shaped with respect to mean processing times. Other characterizations of optimal solutions are also established. Based on the optimality properties, algorithms with pseudopolynomial time complexity are proposed to solve both versions of the problem. © 1996 John Wiley & Sons, Inc. 相似文献
29.
科学构建信息时代我军舆论战基本理论,主要包括基础理论、指挥理论、法规理论和战法理论,对我军加强军事斗争准备、打赢未来信息化战争具有重要的理论价值和现实意义。 相似文献
30.
Statistical analysis for masked system life data from Marshall‐Olkin Weibull distribution under progressive hybrid censoring 下载免费PDF全文
This paper considers the statistical analysis of masked data in a series system, where the components are assumed to have Marshall‐Olkin Weibull distribution. Based on type‐I progressive hybrid censored and masked data, we derive the maximum likelihood estimates, approximate confidence intervals, and bootstrap confidence intervals of unknown parameters. As the maximum likelihood estimate does not exist for small sample size, Gibbs sampling is used to obtain the Bayesian estimates and Monte Carlo method is employed to construct the credible intervals based on Jefferys prior with partial information. Numerical simulations are performed to compare the performances of the proposed methods and one data set is analyzed. 相似文献