首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2827篇
  免费   556篇
  国内免费   186篇
  2024年   4篇
  2023年   13篇
  2022年   24篇
  2021年   38篇
  2020年   32篇
  2019年   65篇
  2018年   53篇
  2017年   117篇
  2016年   127篇
  2015年   89篇
  2014年   237篇
  2013年   309篇
  2012年   187篇
  2011年   241篇
  2010年   198篇
  2009年   219篇
  2008年   170篇
  2007年   198篇
  2006年   177篇
  2005年   176篇
  2004年   167篇
  2003年   122篇
  2002年   87篇
  2001年   97篇
  2000年   53篇
  1999年   55篇
  1998年   45篇
  1997年   38篇
  1996年   34篇
  1995年   25篇
  1994年   38篇
  1993年   24篇
  1992年   24篇
  1991年   25篇
  1990年   32篇
  1989年   16篇
  1988年   10篇
  1987年   2篇
  1975年   1篇
排序方式: 共有3569条查询结果,搜索用时 15 毫秒
831.
本文为在野战条件下检测雷达测距系统的性能提供一种新型微波目标信号模拟器,闸述其工作原理及功能。除在检测雷达测距系统性能上已得到实际应用外,还论述了可以进一步开发的应用项目,因为不受场地和气候条件的限制,从而获得较好的效能、效率和效益。  相似文献   
832.
针对协同性联合作战向一体化联合作战转变对作战指挥产生的影响,在正确定位指挥信息流通体系的基础上,从一体化联合作战的本质特征及对指挥信息流通体系的影响出发,设计了基本作战单元指挥信息输入、输出模型,并通过将作战体系区分为四类模块,得出了指挥信息流通体系的逻辑结构.  相似文献   
833.
2009年,Tu和Deng在一个组合猜想成立的基础上,构造了同时具有最优代数免疫性、最优代数次数和高非线性度的一类偶数元布尔函数.这类函数被称为Tu-Deng函数.基于同一猜想,Tu和Deng又构造了同时具有次最优代数免疫性、最优代数次数和较高非线性度的一类偶数元的l -阶弹性函数.通过研究由Tu-Deng函数导出的两个布尔函数的级联的密码学性质,在Tu-Deng猜想成立的基础上,给出一类奇数元的1 -阶弹性布尔函数.这类函数同时具有次最优代数免疫性、最优代数次数和较高非线性度.  相似文献   
834.
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  相似文献   
835.
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  相似文献   
836.
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  相似文献   
837.
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  相似文献   
838.
针对无人机在单站测角测距的目标定位过程中受无人机姿态角误差影响较大的问题,提出一种对辅助信标进行探测并与惯性传感器相结合的无人机姿态求解方法。建立基于容积卡尔曼滤波的惯性传感器姿态求解模型,采用梯度下降法对基于辅助信标的无人机位姿参数进行求解,并综合它们的结果对无人机的姿态偏差进行估计和校正,最后完成了不同视场条件下的目标定位和仿真计算。结果表明,所提方法对无人机目标定位精度有明显提高。  相似文献   
839.
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.  相似文献   
840.
ABSTRACT

The slow moving conflict in the South China Sea has been characterized by some as “not worth the candle.” China claims the entirety of the South China Sea pursuant to a nine-dash line, the legal impact of which has been limited by international courts. At the same time, China has changed the reality of control over the South China Sea by building a number of fortified islands in the Spratly Islands and elsewhere. The US has either refused to stand up to China's behavior (Obama) or responded unevenly (Trump). This paper examines the impact of China's behaviour on local parties, US interests, and the liberal international system.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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