首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   558篇
  免费   198篇
  国内免费   48篇
  2024年   1篇
  2022年   3篇
  2021年   16篇
  2020年   8篇
  2019年   10篇
  2018年   5篇
  2017年   30篇
  2016年   40篇
  2015年   24篇
  2014年   45篇
  2013年   78篇
  2012年   29篇
  2011年   34篇
  2010年   27篇
  2009年   32篇
  2008年   37篇
  2007年   36篇
  2006年   39篇
  2005年   49篇
  2004年   37篇
  2003年   34篇
  2002年   28篇
  2001年   22篇
  2000年   18篇
  1999年   21篇
  1998年   23篇
  1997年   11篇
  1996年   11篇
  1995年   8篇
  1994年   9篇
  1993年   9篇
  1992年   5篇
  1991年   4篇
  1990年   18篇
  1989年   3篇
排序方式: 共有804条查询结果,搜索用时 15 毫秒
21.
基于对象Petri网(OPN)的C3I系统仿真建模   总被引:6,自引:3,他引:3  
首先介绍了OPN的特点和利用OPN建立C3I系统仿真模型的一般步骤,然后用一个简单的实例说明了该方法的使用情况,并总结了该方法在建立C3I系统仿真模型中的优缺点.  相似文献   
22.
给出某地炮营通信系统信息传输的CSMA/CD(Carrier Sense Multiple Acces/Collision Detection)排队论模型,提出了信道争用和碰撞的问题,用单机和网络仿真分析了载波监听条件下通信失效的概率,给出信道争用和碰撞的几个性能指标,并利用软件的方法,提供了减少碰撞的方案  相似文献   
23.
根据区域攻防的不同战场信息行动,建立3个非线性微分方程模型.以防御方的总射击速率和战斗力消耗率作为评价指标,着重探讨了进攻方的指挥控制系统、侦察监视系统、战毁评估系统和火力系统之间的性能匹配关系.  相似文献   
24.
防空导弹武器系统C3I仿真系统一体化研究   总被引:3,自引:0,他引:3  
现代化的高科技战争中,C3I系统已成为武器系统的"神经中枢",建立一体化的C3I系统是联合作战、统一指挥的需要,同时也对C3I的仿真系统提出了一体化的要求。结合防空导弹武器两级指控仿真系统互操作问题的研究,首先简要介绍了仿真系统一体化的有关标准,然后介绍了互连的方式和对象,探讨和分析了互操作的模型、特点以及互操作性等级的评定。  相似文献   
25.
分布式防空C3I模型信息关系及其交互关键技术研究   总被引:1,自引:0,他引:1  
对分布式防空C3I仿真中信息交互关键技术进行了研究。分析了各子模型信息关系,研究了信息有效交互的途径和提高信息交互速度的方法,并对组播通信组的划分方法进行了深入研究,提出了基于信息流的组播通信组的划分方法。  相似文献   
26.
指挥控制通信与情报(C3I)系统的评价   总被引:5,自引:0,他引:5  
综述了目前用于评价C3I系统的各类方法与过程,讨论了C3I系统的评价框架,并对这个框架下的各种评价方法与过程的长处和不足提出了作者的看法  相似文献   
27.
This study investigates the statistical process control application for monitoring queue length data in M/G/1 systems. Specifically, we studied the average run length (ARL) characteristics of two different control charts for detecting changes in system utilization. First, the nL chart monitors the sums of successive queue length samples by subgrouping individual observations with sample size n. Next is the individual chart with a warning zone whose control scheme is specified by two pairs of parameters, (upper control limit, du) and (lower control limit, dl), as proposed by Bhat and Rao (Oper Res 20 (1972) 955–966). We will present approaches to calculate ARL for the two types of control charts using the Markov chain formulation and also investigate the effects of parameters of the control charts to provide useful design guidelines for better performance. Extensive numerical results are included for illustration. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
28.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
29.
针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...  相似文献   
30.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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