首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   556篇
  免费   212篇
  国内免费   31篇
  2024年   2篇
  2023年   2篇
  2022年   5篇
  2021年   19篇
  2020年   18篇
  2019年   11篇
  2018年   8篇
  2017年   31篇
  2016年   41篇
  2015年   26篇
  2014年   39篇
  2013年   57篇
  2012年   38篇
  2011年   46篇
  2010年   25篇
  2009年   48篇
  2008年   42篇
  2007年   41篇
  2006年   41篇
  2005年   48篇
  2004年   32篇
  2003年   29篇
  2002年   20篇
  2001年   18篇
  2000年   17篇
  1999年   19篇
  1998年   23篇
  1997年   7篇
  1996年   4篇
  1995年   3篇
  1994年   6篇
  1993年   5篇
  1992年   3篇
  1991年   5篇
  1990年   18篇
  1989年   2篇
排序方式: 共有799条查询结果,搜索用时 15 毫秒
281.
卫星工具软件STK(Satellite Tool Kit)是航天领域中进行卫星系统分析和仿真的有效工具,其重要模块之一STK/Connect可提供用户在客户机/服务器环境下与STK连接的功能.在深入研究STK/Connect模块的核心技术的基础上,详细说明了第三方应用程序与STK进行通信的方法,并将其应用于GPS应用仿真演示系统,同时进行了编程实现,取得了较好的效果.  相似文献   
282.
独特的微机正弦扫频振动控制技术   总被引:1,自引:0,他引:1       下载免费PDF全文
以通用微机为主控单元进行正弦扫频振动控制的独特之处在于驱动信号的生成、修正,响应信号的采样、分析以及系统传递函数计算等控制功能均主要由微机软件完成。本文主要介绍上述控制功能的软件设计原理,并给出相应的实验结果。  相似文献   
283.
We consider the problem of maximizing the number of on‐time jobs on two uniform parallel machines. We show that a straightforward extension of an algorithm developed for the simpler two identical parallel machines problem yields a heuristic with a worst‐case ratio bound of at least . We then show that the infusion of a “look ahead” feature into the aforementioned algorithm results in a heuristic with the tight worst‐case ratio bound of , which, to our knowledge, is the tightest worst‐case ratio bound available for the problem. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
284.
本文论述了提高智能工具机性能所采取的技术措施,并对其性能进行了模拟。模拟结果表明,智能工具机的平均推理速度可达500KLIPS 左右,比日本的PSI—Ⅰ约快一倍,比美国加州大学Berkeley 分校研制的PLM 约快两倍。  相似文献   
285.
本文以排队论为工具建立了紧耦合多处理机系统存贮器的排队模型。通过对存贮体忙期的分析,得出了存贮器有效频带的解析表达式,研究了在保证存贮器有效频带最大的情况下,处理机的访存请求率λ、存贮体的服务率μ和存贮体数m 三者之间的关系。  相似文献   
286.
本文首先介绍单片机控制的指挥仪航路产生系统的原理及组成,重点讨论了目标现在点坐标由数字量到指挥仪所需要的模拟信号的转换方法,最后对该系统的误差结果进行了分析。  相似文献   
287.
288.
We investigate the solvability of two single‐machine scheduling problems when the objective is to identify among all job subsets with cardinality k,1≤kn, the one that has the minimum objective function value. For the single‐machine minimum maximum lateness problem, we conclude that the problem is solvable in O(n2) time using the proposed REMOVE algorithm. This algorithm can also be used as an alternative to Moore's algorithm to solve the minimum number of tardy jobs problem by actually solving the hierarchical problem in which the objective is to minimize the maximum lateness subject to the minimum number of tardy jobs. We then show that the REMOVE algorithm cannot be used to solve the general case of the single‐machine total‐weighted completion time problem; we derive sufficient conditions among the job parameters so that the total weighted completion time problem becomes solvable in O(n2) time. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 449–453, 2013  相似文献   
289.
Rarely has a military commitment led to such intense discussion in the Netherlands as the Task Force Uruzgan (TFU) mission in Afghanistan. In February 2010, the Netherlands' coalition government even collapsed after the two largest parties failed to agree on the withdrawal of Dutch troops from Afghanistan later this year. This article deals first of all with the difficult discussion over the Afghanistan mission of the TFU. The authors then subject three ISAF operations to close scrutiny. The authors provide some suggestions to help understand better this pivotal point in the execution of the whole operation and thus give a fuller picture of the Dutch counterinsurgency approach in Uruzgan.  相似文献   
290.
By any objective measure, defense institutions in Central and Eastern Europe have all but universally been incapable of producing viable defense plans that are based on objective costing and operational planning data. This situation exists in spite the provision of considerable Western advice and assistance, let alone reporting to and receiving assessments by NATO’s International Staff under Partnership for Peace, as well as via the integrated defense planning and reporting systems. An explanation for this systematic failure across European post-Communist defense institutions can be found in the continued slow development of an over-arching policy framework which directs and approves all activities of the armed forces, as well as the de-centralization of financial decision-making down to capability providers. The essay ends with an examination of the adverse effects of the early introduction of planning programming, budgeting system (PPBS), have had on the development of effective policy and planning capabilities within these defense institutions.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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