首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   434篇
  免费   18篇
  452篇
  2025年   4篇
  2024年   5篇
  2023年   17篇
  2022年   9篇
  2021年   2篇
  2020年   14篇
  2019年   5篇
  2018年   9篇
  2017年   18篇
  2016年   21篇
  2015年   16篇
  2014年   33篇
  2013年   25篇
  2012年   31篇
  2011年   23篇
  2010年   16篇
  2009年   23篇
  2008年   20篇
  2007年   30篇
  2006年   19篇
  2005年   18篇
  2004年   18篇
  2003年   14篇
  2002年   11篇
  2001年   7篇
  2000年   8篇
  1999年   3篇
  1998年   3篇
  1997年   4篇
  1996年   7篇
  1995年   4篇
  1993年   3篇
  1992年   2篇
  1991年   5篇
  1990年   2篇
  1989年   3篇
排序方式: 共有452条查询结果,搜索用时 0 毫秒
301.
    
Piracy attack is a serious safety problem for maritime transport worldwide. Whilst various strategic actions can be taken, such as rerouting vessels and strengthening navy patrols, this still cannot completely eliminate the possibility of a piracy attack. It is therefore important for a commercial vessel to be equipped with operational solutions in case of piracy attacks. In particular, the choice of a direction for rapidly fleeing is a critical decision for the vessel. In this article, we formulate such a problem as a nonlinear optimal control problem. We consider various policies, such as maintaining a straight direction or making turns, develop algorithms to optimize the policies, and derive conditions under which these policies are effective and safe. Our work can be used as a real‐time decision making tool that enables a vessel master to evaluate different scenarios and quickly make decisions.  相似文献   
302.
针对多平台协同搜索的最优搜索问题,以多无人机区域搜索任务为背景,将搜索论和随机规划引入到编队协同搜索中,建立了环境模型、无人机模型、传感器模型;为了解决目标丢失后的“应召”搜索问题,建立了目标的随机漫游模型;通过对搜索力最优分配问题的分析,认为其实质为一类线性规划问题,提出了一种基于递归原理的解算方法;最后,通过仿真计算,证明了该随机漫游模型的合理性,并验证了所提算法的有效性。  相似文献   
303.
翼伞归航轨迹规划与控制问题是翼伞系统在一定初始状态下,利用自身可操作性,完成从初始位置到目标位置的转移问题。针对翼伞空投系统不同归航要求,规划出满足精度要求为圆径概率误差( CEP )小于40m的归航轨迹并经过一定量的控制完成翼伞空投系统精确空投任务。首先建立翼伞系统状态空间六自由度模型,并在此基础上提出系统简化稳态模型,通过最优控制方法,规划出满足空投要求的最优归航轨迹后对翼伞进行不断控制直至目标点。最后通过Matlab仿真试验,绘出翼伞系统归航轨迹图与控制变化图。  相似文献   
304.
    
We study joint preventive maintenance (PM) and production policies for an unreliable production‐inventory system in which maintenance/repair times are non‐negligible and stochastic. A joint policy decides (a) whether or not to perform PM and (b) if PM is not performed, then how much to produce. We consider a discrete‐time system, formulating the problem as a Markov decision process (MDP) model. The focus of the work is on the structural properties of optimal joint policies, given the system state comprised of the system's age and the inventory level. Although our analysis indicates that the structure of optimal joint policies is very complex in general, we are able to characterize several properties regarding PM and production, including optimal production/maintenance actions under backlogging and high inventory levels, and conditions under which the PM portion of the joint policy has a control‐limit structure. In further special cases, such as when PM set‐up costs are negligible compared to PM times, we are able to establish some additional structural properties. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
305.
DEA方法在防空作战方案优选中的应用   总被引:2,自引:0,他引:2  
针对现代防空作战对决策速度和准确性的要求,运用DEA方法研究了防空作战方案优选问题。根据防空作战方案构成的主要要素,建立了防空作战方案的C2R评估模型,从“技术有效”和“规模有效”两个方面对备选方案的有效性进行综合分析,得出各方案评估结果,为指挥员优选方案提供了科学准确的依据。与传统的方法相比,该方法不仅具有内在的客观性,避免了方案中投入和产出指标间的相互制约,而且易于实现计算机处理,有效保障指挥员在防空作战中快速准确选定作战方案。  相似文献   
306.
针对敌空袭和我防空兵器的主要特点,运用匈牙利法研究弹炮混编防空兵群火力分配优化问题.在确定弹炮混编防空兵群火力分配相关术语的基础上,建立了火力分配模型,结合匈牙利法的基本原理,得到弹炮混编防空兵群火力分配的方案。通过算例,证明了该方法的可行性,为有效解决弹炮混编防空兵群火力分配优化问题提供了一种较为科学的方法。  相似文献   
307.
    
Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
308.
    
The Signal‐to‐Interference‐plus‐Noise Ratio (SINR) is an important metric of wireless communication link quality. SINR estimates have several important applications. These include optimizing the transmit power level for a target quality of service, assisting with handoff decisions and dynamically adapting the data rate for wireless Internet applications. Accurate SINR estimation provides for both a more efficient system and a higher user‐perceived quality of service. In this paper, we develop new SINR estimators and compare their mean squared error (MSE) performance. We show that our new estimators dominate estimators that have previously appeared in the literature with respect to MSE. The sequence of transmitted bits in wireless communication systems consists of both pilot bits (which are known both to the transmitter and receiver) and user bits (which are known only by the transmitter). The SINR estimators we consider alternatively depend exclusively on pilot bits, exclusively on user bits, or simultaneously use both pilot and user bits. In addition, we consider estimators that utilize smoothing and feedback mechanisms. Smoothed estimators are motivated by the fact that the interference component of the SINR changes relatively slowly with time, typically with the addition or departure of a user to the system. Feedback estimators are motivated by the fact that receivers typically decode bits correctly with a very high probability, and therefore user bits can be thought of as quasipilot bits. For each estimator discussed, we derive an exact or approximate formula for its MSE. Satterthwaite approximations, noncentral F distributions (singly and doubly) and distribution theory of quadratic forms are the key statistical tools used in developing the MSE formulas. In the case of approximate MSE formulas, we validate their accuracy using simulation techniques. The approximate MSE formulas, of interest in their own right for comparing the quality of the estimators, are also used for optimally combining estimators. In particular, we derive optimal weights for linearly combining an estimator based on pilot bits with an estimator based on user bits. The optimal weights depend on the MSE of the two estimators being combined, and thus the accurate approximate MSE formulas can conveniently be used. The optimal weights also depend on the unknown SINR, and therefore need to be estimated in order to construct a useable combined estimator. The impact on the MSE of the combined estimator due to estimating the weights is examined. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
309.
    
Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining bounds to the optimal burn‐in time and optimal replacement policy maximizing the steady state availability of a repairable system. It is assumed that two types of system failures may occur: One is Type I failure (minor failure), which can be removed by a minimal repair, and the other is Type II failure (catastrophic failure), which can be removed only by a complete repair. Assuming that the underlying lifetime distribution of the system has a bathtub‐shaped failure rate function, upper and lower bounds for the optimal burn‐in time are provided. Furthermore, some other applications of optimal burn‐in are also considered. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
310.
    
Motivated by wind energy applications, we consider the problem of optimally replacing a stochastically degrading component that resides and operates in a partially observable environment. The component's rate of degradation is modulated by the stochastic environment process, and the component fails when it is accumulated degradation first reaches a fixed threshold. Assuming periodic inspection of the component, the objective is to minimize the long‐run average cost per unit time of performing preventive and reactive replacements for two distinct cases. The first case examines instantaneous replacements and fixed costs, while the second considers time‐consuming replacements and revenue losses accrued during periods of unavailability. Formulated and solved are mixed state space, partially observable Markov decision process models, both of which reveal the optimality of environment‐dependent threshold policies with respect to the component's cumulative degradation level. Additionally, it is shown that for each degradation value, a threshold policy with respect to the environment belief state is optimal if the environment alternates between two states. The threshold policies are illustrated by way of numerical examples using both synthetic and real wind turbine data. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 395–415, 2015  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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