首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   517篇
  免费   145篇
  国内免费   60篇
  2024年   1篇
  2022年   3篇
  2021年   16篇
  2020年   7篇
  2019年   6篇
  2018年   5篇
  2017年   21篇
  2016年   33篇
  2015年   15篇
  2014年   36篇
  2013年   56篇
  2012年   35篇
  2011年   41篇
  2010年   28篇
  2009年   47篇
  2008年   46篇
  2007年   40篇
  2006年   29篇
  2005年   34篇
  2004年   27篇
  2003年   25篇
  2002年   28篇
  2001年   23篇
  2000年   10篇
  1999年   20篇
  1998年   20篇
  1997年   11篇
  1996年   11篇
  1995年   8篇
  1994年   9篇
  1993年   6篇
  1992年   2篇
  1991年   4篇
  1990年   17篇
  1989年   2篇
排序方式: 共有722条查询结果,搜索用时 46 毫秒
31.
基于对象Petri网(OPN)的C3I系统仿真建模   总被引:6,自引:3,他引:3  
首先介绍了OPN的特点和利用OPN建立C3I系统仿真模型的一般步骤,然后用一个简单的实例说明了该方法的使用情况,并总结了该方法在建立C3I系统仿真模型中的优缺点.  相似文献   
32.
给出某地炮营通信系统信息传输的CSMA/CD(Carrier Sense Multiple Acces/Collision Detection)排队论模型,提出了信道争用和碰撞的问题,用单机和网络仿真分析了载波监听条件下通信失效的概率,给出信道争用和碰撞的几个性能指标,并利用软件的方法,提供了减少碰撞的方案  相似文献   
33.
根据区域攻防的不同战场信息行动,建立3个非线性微分方程模型.以防御方的总射击速率和战斗力消耗率作为评价指标,着重探讨了进攻方的指挥控制系统、侦察监视系统、战毁评估系统和火力系统之间的性能匹配关系.  相似文献   
34.
指挥控制通信与情报(C3I)系统的评价   总被引:5,自引:0,他引:5  
综述了目前用于评价C3I系统的各类方法与过程,讨论了C3I系统的评价框架,并对这个框架下的各种评价方法与过程的长处和不足提出了作者的看法  相似文献   
35.
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  相似文献   
36.
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  相似文献   
37.
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  相似文献   
38.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.  相似文献   
39.
针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。  相似文献   
40.
针对C4ISR需求客观上复杂且特殊、主观上难沟通等特点导致C4ISR需求开发难的问题,研究C4ISR需求本体,提出开发C4ISR需求的一条新途径:基于本体建模。首先,构建C4ISR需求本体元模型、语义模型,很大程度上澄清了C4ISR需求领域知识结构;然后,提出基于本体建立C4ISR需求模型的具体步骤;最后,示例说明方法的可行性、有效性,展示了方法的应用前景。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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