全文获取类型
收费全文 | 150篇 |
免费 | 46篇 |
国内免费 | 17篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 4篇 |
2020年 | 1篇 |
2019年 | 4篇 |
2018年 | 3篇 |
2017年 | 7篇 |
2016年 | 14篇 |
2015年 | 6篇 |
2014年 | 11篇 |
2013年 | 8篇 |
2012年 | 17篇 |
2011年 | 13篇 |
2010年 | 6篇 |
2009年 | 11篇 |
2008年 | 14篇 |
2007年 | 15篇 |
2006年 | 8篇 |
2005年 | 10篇 |
2004年 | 12篇 |
2003年 | 5篇 |
2002年 | 9篇 |
2001年 | 9篇 |
2000年 | 1篇 |
1999年 | 8篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1991年 | 2篇 |
排序方式: 共有213条查询结果,搜索用时 382 毫秒
141.
定量分析了雷达检测波门及波位的设置、搜索周期、目标及弹丸运动的速度,方向等因素对弹丸检测概率的影响,并针对给定的参数和航路对检测概率进行了计算机仿真。 相似文献
142.
针对基于旁路信号分析的硬件木马检测中存在的高维以及信号冗余度高等问题,寻求一种特征选择方法在降维、降低冗余度方面的可行性,通过考虑样本概率的分布情况,提出了一种以散度和Bhattacharyya距离作为可分性判据的特征选择方法。首先分析了旁路信号的特征选择问题,然后阐述了基于散度和Bhattacharyya距离的可分性判据,最后在FPGA中植入硬件木马,采用K-L方法进行实验,通过对样本特征选择前后的检测效果发现,这种特征选择方法不仅有助于分辨"金片"与含木马的待测芯片间旁路信号的统计差异,而且与分类错误率建立联系,更好地实现了硬件木马的检测。 相似文献
143.
Parametric inference for component distributions from lifetimes of systems with dependent components
In system reliability analysis, for an n ‐component system, the estimation of the performance of the components in the system is not straightforward in practice, especially when the components are dependent. Here, by assuming the n components in the system to be identically distributed with a common distribution belonging to a scale‐family and the dependence structure between the components being known, we discuss the estimation of the lifetime distributions of the components in the system based on the lifetimes of systems with the same structure. We develop a general framework for inference on the scale parameter of the component lifetime distribution. Specifically, the method of moments estimator (MME) and the maximum likelihood estimator (MLE) are derived for the scale parameter, and the conditions for the existence of the MLE are also discussed. The asymptotic confidence intervals for the scale parameter are also developed based on the MME and the MLE. General simulation procedures for the system lifetime under this model are described. Finally, some examples of two‐ and three‐component systems are presented to illustrate all the inferential procedures developed here. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
144.
成败型产品的Bayes鉴定试验方案研究 总被引:4,自引:1,他引:3
利用可靠性增长模型给出了成败型产品鉴定试验的一种Bayes方法.提出了Bayes鉴定试验的最大后验风险准则,利用这种准则制定的鉴定试验方案综合了产品研制过程中的先验信息.在确保产品质量的前提下,与传统的鉴定试验方案相比,将大大节省试验时间. 相似文献
145.
146.
147.
Hausdorff距离(HD)是图像匹配常用的相似性准则。针对HD在实际图像中难以匹配的问题,提出了基于核密度函数的HD改进形式,该HD是通过对各个最小距离值进行核密度函数计算,并将函数值的和的均值作为单向HD值,无向的HD值取两个单向值的最小值。实验结果表明,提出的改进HD在遮挡、局部变化情况下比其它的HD距离具有较好匹配效果。 相似文献
148.
Nader Ebrahimi 《海军后勤学研究》2005,52(1):46-57
Diffusion processes are commonly used to describe the dynamics of complex systems arising in a wide range of application fields. In this paper we propose, on the basis of diffusion processes, two models concerned with the stochastic behavior of fatigue cracks in a system. They are then used to get the distribution of the failure time, the first time the crack size of at least one of the cracks exceeds a given value. Several properties of our proposed models are presented, and the unknown parameters are estimated by the method of maximum likelihood. From these an estimate of failure time distribution is obtained. In this part, contrary to common practice, we do not assume availability of failure data. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
149.
A problem we call recurrent construction involves manufacturing large, complex, expensive products such as airplanes, houses, and ships. Customers order configurations of these products well in advance of due dates for delivery. Early delivery may not be permitted. How should the manufacturer determine when to purchase and release materials before fabrication, assembly, and delivery? Major material expenses, significant penalties for deliveries beyond due dates, and long product makespans in recurrent construction motivate choosing a release timetable that maximizes the net present value of cash flows. Our heuristic first projects an initial schedule that dispatches worker teams to tasks for the backlogged products, and then solves a series of maximal closure problems to find material release times that maximize NPV. This method compares favorably with other well‐known work release heuristics in solution quality for large problems over a wide range of operating conditions, including order strength, cost structure, utilization level, batch policy, and uncertainty level. Computation times exhibit near linear growth in problem size. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
150.
We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f1(C1), f2(C2), … , fn(Cn)), where fi(Ci) is a general, nondecreasing function of the completion time Ci of task i. We show that the optimal sequence to minimize the maximum cost MC = max fi(Ci) can be derived by a simple rule if there exists an order f1(t) ≤ … ≤ fn(t) for all t between the functions {fi(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ fi(Ci) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献