全文获取类型
收费全文 | 915篇 |
免费 | 67篇 |
国内免费 | 43篇 |
出版年
2022年 | 2篇 |
2021年 | 31篇 |
2020年 | 39篇 |
2019年 | 47篇 |
2018年 | 48篇 |
2017年 | 69篇 |
2016年 | 52篇 |
2015年 | 17篇 |
2014年 | 102篇 |
2013年 | 139篇 |
2012年 | 44篇 |
2011年 | 48篇 |
2010年 | 58篇 |
2009年 | 42篇 |
2008年 | 41篇 |
2007年 | 40篇 |
2006年 | 42篇 |
2005年 | 33篇 |
2004年 | 35篇 |
2003年 | 17篇 |
2002年 | 13篇 |
2001年 | 19篇 |
2000年 | 8篇 |
1999年 | 8篇 |
1998年 | 4篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 2篇 |
排序方式: 共有1025条查询结果,搜索用时 15 毫秒
61.
二维条码技术及其在军事后勤中的应用 总被引:2,自引:0,他引:2
通过对二维条码先进技术特性的客观分析,探讨了二维条码在军事后勤中几个重要领域的应用,对在军事后勤中具体设计和应用二维条码技术进行了初步的研究. 相似文献
62.
通过军校心理学教员队伍现状、心理教育开展情况的调查与访谈,统计了5个方面的第一手资料.总结了军校心理教育的基本经验和存在的主要问题,对进一步发展与完善军校心理教育提出了3点建议,并就抓好心理教育工作提出了4项初步设想. 相似文献
63.
64.
R.E. Lillo 《海军后勤学研究》2001,48(3):201-209
An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001 相似文献
65.
就IDEF0方法在军事综合电子信息系统分析设计、系统升级与集成及仿真等方面的应用进行了深入探讨。由于IDEF0模型具有简单、全面且描述能力强等优点 ,使其在多个领域尤其在制造业中得到了广泛应用。军事综合电子信息系统是以活动为支撑 ,以信息为基础的复杂大系统 ,用IDEF0模型对其进行描述可以加深指挥人员和技术人员对系统的共同理解 ,从而提高系统开发的效率并提高系统的实用性。 相似文献
66.
Let X and Xτ denote the lifetime and the residual life at age τ of a system, respectively. X is said to be a NBUL random variable if Xτ is smaller than X in Laplace order, i.e., Xτ ≤L X. We obtain some characterizations for this class of life distribution by means of the lifetime of a series system and the residual life at random time. We also discuss preservation properties for this class of life distribution under shock models. Finally, under the assumption that the lifetimes have the NBUL property, we make stochastic comparisons between some basic replacement policies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 578–591, 2001. 相似文献
67.
刘玉藏 《中国人民武装警察部队学院学报》2001,17(4):75-76
通过简要介绍消防网络的构成及功能,进行网络安全及需求分析,并结合消防办公信息网的实际恃况,提出制定安全对策的几种建议. 相似文献
68.
This paper develops and applies a nonparametric bootstrap methodology for setting inventory reorder points and a simple inequality for identifying existing reorder points that are unreasonably high. We demonstrate that an empirically based bootstrap method is both feasible and calculable for large inventories by applying it to the 1st Marine Expeditionary Force General Account, an inventory consisting of $20–30 million of stock for 10–20,000 different types of items. Further, we show that the bootstrap methodology works significantly better than the existing methodology based on mean days of supply. In fact, we demonstrate performance equivalent to the existing system with a reduced inventory at one‐half to one‐third the cost; conversely, we demonstrate significant improvement in fill rates and other inventory performance measures for an inventory of the same cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 459–478, 2000 相似文献
69.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
70.