首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3097篇
  免费   657篇
  国内免费   227篇
  2024年   9篇
  2023年   15篇
  2022年   34篇
  2021年   51篇
  2020年   42篇
  2019年   72篇
  2018年   72篇
  2017年   116篇
  2016年   138篇
  2015年   107篇
  2014年   262篇
  2013年   302篇
  2012年   206篇
  2011年   258篇
  2010年   212篇
  2009年   254篇
  2008年   189篇
  2007年   226篇
  2006年   197篇
  2005年   184篇
  2004年   182篇
  2003年   134篇
  2002年   111篇
  2001年   110篇
  2000年   64篇
  1999年   64篇
  1998年   49篇
  1997年   50篇
  1996年   45篇
  1995年   30篇
  1994年   45篇
  1993年   29篇
  1992年   34篇
  1991年   23篇
  1990年   34篇
  1989年   16篇
  1988年   12篇
  1987年   2篇
  1975年   1篇
排序方式: 共有3981条查询结果,搜索用时 15 毫秒
961.
导弹攻击是舰艇编队海上行动的主要作战样式,其导弹攻击效能的评估十分重要。首先建立了舰艇编队导弹攻击作战效能评价指标体系,然后介绍了评估舰艇编队导弹攻击效能的一种新方法——优序法,该方法应用简单,既可以处理定性问题,又能处理定量问题。最后给出了应用实例,验证了优序法比较适合于对舰艇编队导弹攻击效能进行评估。通过对舰艇编队导弹攻击效能的评估,可以有效地选用合适的舰艇编队样式。  相似文献   
962.
舰炮防空是水面舰艇自防御的重要手段之一.文章围绕可视化和虚拟现实技术,分析了舰炮防空战法研究的内容,给出了舰炮防空战法可视化的方法,重点探讨了其中的防空弹道仿真、反舰导弹弹道仿真、海浪水文气象环境仿真、战场焰火和爆炸效果仿真及舰炮防空战法仿真中实时碰撞检测的基本方法和优化技术,提出了解决这些问题的主要方法,并在PC机上进行了实现.最后给出了舰炮防空战法的可视化结果.  相似文献   
963.
空中目标战术意图层次推理框架及实现   总被引:1,自引:0,他引:1  
以提高对空态势感知能力为目的,着眼于构建以专家系统为特征的目标意图推理决策支持系统,首先根据目标意图的含义从意图、行动和状态三个层次进行了层次表示,并简要分析了实现意图推理的六种途径.根据空中目标的作战使用等领域知识将其意图从属性类型、战术类型、威胁类型和任务类型四个层次进行了分解.基于意图推理输入信息的分布性特征以及意图的层次分解建立了基于判定树的意图层次推理框架以及数据驱动的推理控制机制.该框架为建立空中目标战术意图的推理实现方法提供了重要的依据.  相似文献   
964.
We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998  相似文献   
965.
The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998  相似文献   
966.
This paper revisits the modeling by Bracken [3] of the Ardennes campaign of World War II using the Lanchester equations. It revises and extends that analysis in a number of ways: (1) It more accurately fits the model parameters using linear regression; (2) it considers the data from the entire campaign; and (3) it adds in air sortie data. In contrast to previous results, it concludes by showing that neither the Lanchester linear or Lanchester square laws fit the data. A new form of the Lanchester equations emerges with a physical interpretation. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 1–22, 1998  相似文献   
967.
We use the matrix-geometric method to study the discrete time MAP/PH/1 priority queue with two types of jobs. Both preemptive and non-preemptive cases are considered. We show that the structure of the R matrix obtained by Miller for the Birth-Death system can be extended to our Quasi-Birth-Death case. For both preemptive and non-preemptive cases the distributions of the number of jobs of each type in the system are obtained and their waiting times are obtained for the non-preemptive. For the preemptive case we obtain the waiting time distribution for the high priority job and the distribution of the lower priority job's wait before it becomes the leading job of its priority class. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 23–50, 1998  相似文献   
968.
本文对非线性的三维涡度方程单向周期问题构造了一种新的谱——差分格式,并证明了格式的稳定性和收敛性。  相似文献   
969.
针对无人机在单站测角测距的目标定位过程中受无人机姿态角误差影响较大的问题,提出一种对辅助信标进行探测并与惯性传感器相结合的无人机姿态求解方法。建立基于容积卡尔曼滤波的惯性传感器姿态求解模型,采用梯度下降法对基于辅助信标的无人机位姿参数进行求解,并综合它们的结果对无人机的姿态偏差进行估计和校正,最后完成了不同视场条件下的目标定位和仿真计算。结果表明,所提方法对无人机目标定位精度有明显提高。  相似文献   
970.
Military units can become to some extent self-governing in war-time battle. At times, they may take the discipline of their soldiers into their own hands and such discipline may be severe. This paper examines incidents in the British military, in both World Wars, where British soldiers were killed by their comrades because they would not fight in the heat of battle. The judicial execution by the military authorities of deserters in the First World War led to much controversy in Britain. It may be much less well-known that in both World Wars there was, on occasion, an extra-judicial practice within the British military of executing soldiers who would not fight in the heat of battle. In such situations ethical dilemmas become very difficult indeed and some of the relevant issues are examined here.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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