首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   116篇
  免费   39篇
  国内免费   10篇
  2023年   1篇
  2022年   1篇
  2021年   1篇
  2020年   4篇
  2019年   4篇
  2018年   2篇
  2017年   1篇
  2016年   6篇
  2015年   3篇
  2014年   11篇
  2013年   8篇
  2012年   13篇
  2011年   13篇
  2010年   5篇
  2009年   6篇
  2008年   5篇
  2007年   7篇
  2006年   9篇
  2005年   9篇
  2004年   8篇
  2003年   4篇
  2002年   9篇
  2001年   7篇
  2000年   5篇
  1999年   4篇
  1998年   2篇
  1997年   2篇
  1996年   4篇
  1995年   1篇
  1994年   1篇
  1993年   1篇
  1991年   1篇
  1990年   6篇
  1989年   1篇
排序方式: 共有165条查询结果,搜索用时 31 毫秒
51.
针对海洋环境影响航母编队作战效能的评估问题,采用层次分析法分析了影响编队效能的海洋环境因子,以美军航母战斗群为例给出了经典航母编队的体系结构,并以该编队结构体系中反潜效能为例,建立了海洋环境影响的三级评估模型。研究思想对航母编队的效能评估有一定参考意义。  相似文献   
52.
Firing multiple artillery rounds from the same location has two main benefits: a high rate of fire at the enemy and improved accuracy as the shooter's aim adjusts to previous rounds. However, firing repeatedly from the same location carries significant risk that the enemy will detect the artillery's location. Therefore, the shooter may periodically move locations to avoid counter‐battery fire. This maneuver is known as the shoot‐and‐scoot tactic. This article analyzes the shoot‐and‐scoot tactic for a time‐critical mission using Markov models. We compute optimal move policies and develop heuristics for more complex and realistic settings. Spending a reasonable amount of time firing multiple shots from the same location is often preferable to moving immediately after firing an initial salvo. Moving frequently reduces risk to the artillery, but also limits the artillery's ability to inflict damage on the enemy.  相似文献   
53.
We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.  相似文献   
54.
Conventional control charts are often designed to optimize out‐of‐control average run length (ARL), while constraining in‐control ARL to a desired value. The widely employed grid search approach in statistical process control (SPC) is time‐consuming with unsatisfactory accuracy. Although the simulation‐based ARL gradient estimators proposed by Fu and Hu [Manag Sci 45 (1999), 395–413] can alleviate this issue, it still requires a large number of simulation runs to significantly reduce the variance of gradient estimators. This article proposes a novel ARL gradient estimation approach based on integral equation for efficient analysis and design of control charts. Although this article compares with the results of Fu and Hu [Manag Sci 45 (1999), 395–413] based on the exponentially weighted moving average (EWMA) control chart, the proposed approach has wide applicability as it can generally fit into any control chart with Markovian property under any distributions. It is shown that the proposed method is able to provide a fast, accurate, and easy‐to‐implement algorithm for the design and analysis of EWMA charts, as compared to the simulation‐based gradient estimation method. Moreover, the proposed gradient estimation method facilitates the computation of high‐order derivatives that are valuable in sensitivity analysis. The code is written in Matlab, which is available on request. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 223–237, 2014  相似文献   
55.
目标选择是军事计划的关键要素之一。基于马尔科夫决策方法,解决具有复杂目标间关联的多阶段目标选择问题。使用与或树描述目标体系各层状态间的影响关联,并以目标体系整体失效为求解目的,建立了基于离散时间MDP的多阶段打击目标选择模型。在LRTDP算法基础上提出一种启发式方法,通过判断从当前目标体系状态到达体系失效状态的演化过程中的可能资源消耗和失败概率,来提供对当前状态的评估值,该方法能有效排除问题搜索空间中不能到达体系失效目的的中间状态,压缩了由于目标间复杂关联而增长的巨大状态空间。用实验验证了该方法有效性,实验结果表明,该方法直观实用,对目标间具有复杂关联关系的目标打击决策有一定参考价值。  相似文献   
56.

We briefly illustrate the application of fundamental principles of economics to three episodes of military history for the second millennium AD. The periods, principles, and cases examined are, first, the European Middle Ages (1000-1300; opportunity cost; siege warfare); second, the Enlightenment and the Age of Battle (1618-1814; expected marginal costs/benefits; the decision to engage in battle); and third, the Cold War (1945-1989; substitution; France's nuclear force de frappe).  相似文献   
57.
The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   
58.
在航天器发射工程中,存在组织过程可靠性评估难以量化的问题。基于航天器发射组织过程的时间特性呈现多个子过程并发执行且子过程具有Markov性和齐次性的特点,使用连续时间Markov链(CTMC)建立多吸收态的组织过程可靠度模型,利用互模拟等价关系(BER)简化组织过程的状态空间,并进一步给出各种状态转移率和组织过程可靠度计算方法。最后,通过数据分析说明模型在航天器发射工程进度计划评估中的作用和意义。  相似文献   
59.
运动模糊图像的运动模糊方向鉴别   总被引:17,自引:0,他引:17       下载免费PDF全文
曝光瞬间造成图像模糊的运动通常作为直线运动近似处理,若能找出模糊图像的运动模糊方向,并将之旋转到水平轴,则二维问题可简化为一维来处理,大大简化由模糊图像估计出运动模糊点扩散函数以及图像恢复的过程,并为图像恢复的并行计算创造有利条件。由于运动模糊降低了运动方向上图像的高频成分,沿着运动方向实施高通滤波(方向微分),可保证微分图像灰度值(绝对值)之和最小。基于此,本文利用双线性插值的方法,固定并适当选取方向微分的微元大小,构造出3×3方向微分乘子,得到了高效高精度的自动鉴别运动模糊方向的新方法,并通过数值实验进行了验证。  相似文献   
60.
主要利用离散马尔可夫链(DTMC)对多层弹道导弹防御系统反导作战射击策略问题进行了研究.定义了多层弹道导弹防御体系防御层识别矩阵、拦截矩阵、综合防御能力矩阵等描述多层弹道导弹防御体系防御层作战能力的相关概念,建立了多层弹道导弹防御体系的DTMC模型.在此基础上,应用多层弹道导弹防御体系的DTMC模型对多层弹道导弹防御体系射击策略对作战效能的影响进行了预测分析,最后应用实例验证了模型的有效性及实用性.研究结果可为制定多层弹道导弹防御体系射击策略问题提供决策依据.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号