首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   574篇
  免费   5篇
  国内免费   7篇
  2021年   14篇
  2020年   8篇
  2019年   4篇
  2017年   11篇
  2016年   10篇
  2015年   15篇
  2014年   11篇
  2013年   61篇
  2012年   32篇
  2011年   40篇
  2010年   30篇
  2009年   27篇
  2008年   38篇
  2007年   23篇
  2006年   22篇
  2005年   15篇
  2004年   12篇
  2003年   3篇
  2002年   3篇
  2001年   7篇
  2000年   4篇
  1998年   6篇
  1997年   6篇
  1995年   5篇
  1994年   4篇
  1993年   10篇
  1992年   7篇
  1991年   6篇
  1989年   12篇
  1988年   3篇
  1987年   10篇
  1986年   10篇
  1985年   7篇
  1983年   5篇
  1982年   5篇
  1981年   8篇
  1980年   9篇
  1979年   11篇
  1978年   4篇
  1977年   6篇
  1976年   7篇
  1975年   7篇
  1974年   2篇
  1973年   2篇
  1972年   12篇
  1971年   3篇
  1970年   3篇
  1969年   9篇
  1968年   7篇
  1966年   3篇
排序方式: 共有586条查询结果,搜索用时 78 毫秒
541.
在登陆作战中,直接火力准备起着至关重要的作用,直接关系到登陆兵能否冲击上陆成功.考虑到实际作战中的模糊不确定性和多属性问题,利用模糊数学理论与多属性决策方法,将指派问题拓展到模糊条件下,针对登陆作战中如何发挥直接火力准备的最大效能问题,建立了模糊状态下的多目标指派模型,提供了求解方法,简要地对模型进行了动态化研究,并通过一仿真算例说明模型的应用效果较好,能为未来登陆作战提供辅助决策支持.  相似文献   
542.
为简化描述脉冲积累数、雷达参数及目标后向散射截面与发现概率、虚警概率之间的关系,结合伪装效果检测情况,提出了一种评价目标伪装前后雷达发现概率的方法,即构建评价函数对上述关系进行特征逼近研究.结果表明,该评价函数能反映伪装前后目标RCS与背景RCS比值的变化规律,且计算过程简单,可用于雷达检测评估.  相似文献   
543.
考虑了一类不确定系统的具有闭环极点约束的输出反馈H∞控制,运用基于线性矩阵不等式的方法(LMI),由二次D-稳定导出了鲁棒D-稳定的输出反馈控制器存在的充分条件和设计方法.该方法虽然具有一定的保守性,但求解方便有效,且易于扩展到多目标鲁棒控制.最后,仿真说明了该设计方法的正确性.  相似文献   
544.
We consider a manufacturer (i.e., a capacitated supplier) that produces to stock and has two classes of customers. The primary customer places orders at regular intervals of time for a random quantity, while the secondary customers request a single item at random times. At a predetermined time the manufacturer receives advance demand information regarding the order size of the primary customer. If the manufacturer is not able to fill the primary customer's demand, there is a penalty. On the other hand, serving the secondary customers results in additional profit; however, the manufacturer can refuse to serve the secondary customers in order to reserve inventory for the primary customer. We characterize the manufacturer's optimal production and stock reservation policies that maximize the manufacturer's discounted profit and the average profit per unit time. We show that these policies are threshold‐type policies, and these thresholds are monotone with respect to the primary customer's order size. Using a numerical study we provide insights into how the value of information is affected by the relative demand size of the primary and secondary customers. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
545.
Resource-constrained project scheduling with cash flows occurs in many settings, ranging from research and development to commercial and residential construction. Although efforts have been made to develop efficient optimal procedures to maximize the net present value of cash flows for resource-constrained projects, the inherent intractability of the problem has led to the development of a variety of heuristic methods to aid in the development of near-optimal schedules for large projects. This research focuses on the use of insights gained from the solution of a relaxed optimization model in developing heuristic procedures to schedule projects with multiple constrained resources. It is shown that a heuristic procedure with embedded priority rules that uses information from the revised solution of a relaxed optimization model increases project net present value. The heuristic procedure and nine different embedded priority rules are tested in a variety of project environments that account for different network structures, levels of resource constrainedness, and cash-flow parameters. Extensive testing with problems ranging in size from 21 to 1000 activities shows that the new heuristic procedures dominate heuristics using information from the critical path method (CPM), and in most cases outperform heuristics from previous research. The best performing heuristic rules classify activities into priority and secondary queues according to whether they lead to immediate progress payments, thus front loading the project schedule. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 365–381, 1997  相似文献   
546.
In this article we study the problem of scheduling independent tasks, each of which requires the simultaneous availability of a set of prespecified processors, with the objective of minimizing the maximum completion time. We propose a graph-theoretical approach and identify a class of polynomial instances, corresponding to comparability graphs. We show that the scheduling problem is polynomially equivalent to the problem of extending a graph to a comparability graph whose maximum weighted clique has minimum weight. Using this formulation we show that in some cases it is possible to decompose the problem according to the canonical decomposition of the graph. Finally, a general solution procedure is given that includes a branch-and-bound algorithm for the solution of subproblems which can be neither decomposed nor solved in polynomial time. Some examples and computational results are presented. © 1994 John Wiley & Sons, Inc.  相似文献   
547.
We undertake inference for a stochastic form of the Lanchester combat model. In particular, given battle data, we assess the type of battle that occurred and whether or not it makes any difference to the number of casualties if an army is attacking or defending. Our approach is Bayesian and we use modern computational techniques to fit the model. We illustrate our method using data from the Ardennes campaign. We compare our results with previous analyses of these data by Bracken and Fricker. Our conclusions are somewhat different to those of Bracken. Where he suggests that a linear law is appropriate, we show that the logarithmic or linear‐logarithmic laws fit better. We note however that the basic Lanchester modeling assumptions do not hold for the Ardennes data. Using Fricker's modified data, we show that although his “super‐logarithmic” law fits best, the linear, linear‐logarithmic, and logarithmic laws cannot be ruled out. We suggest that Bayesian methods can be used to make inference for battles in progress. We point out a number of advantages: Prior information from experts or previous battles can be incorporated; predictions of future casualties are easily made; more complex models can be analysed using stochastic simulation techniques. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 541–558, 2000  相似文献   
548.
549.
Once dismissed by many outside observers, the Chinese People’s Liberation Army Air Force (PLAAF) has undergone an impressive transformation over the past two decades, emerging as one of the world’s premier air forces. As it continues to modernize, it is focused on becoming a ‘strategic air force.’ PLAAF strategists suggest this means it should play a decisive role in protecting Chinese national interests, field modern capabilities commensurate with China’s standing as a major power, and enjoy the institutional status befitting its role as a ‘strategic service,’ an important consideration given the historical dominance of the ground force in China’s military.  相似文献   
550.
The debate over whether there exists a British counter-insurgency tradition of minimum force is one that has been thoroughly discussed. Is there anything left to say? This study suggests there is further insight to be attained if one explicitly evaluates the concept of minimum force in relation to the conduct of the security forces in the years of the Northern Ireland conflict. Through an examination of three key periods in the conflict, it will be shown that while there was invariably an awareness of the need to act with restraint among senior officers at the strategic level, this was often difficult to apply at the tactical level in the heat of confrontation. The argument demonstrates that the British Army, and other instruments of the state, rarely acted in a manner that could be described as ‘minimal’. Instead, it was the broader liberal values of the British state that explains largely the degrees of restraint exhibited by the government and security forces.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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