全文获取类型
收费全文 | 553篇 |
免费 | 206篇 |
国内免费 | 43篇 |
出版年
2024年 | 2篇 |
2023年 | 5篇 |
2022年 | 7篇 |
2021年 | 8篇 |
2020年 | 14篇 |
2019年 | 16篇 |
2018年 | 9篇 |
2017年 | 27篇 |
2016年 | 32篇 |
2015年 | 25篇 |
2014年 | 42篇 |
2013年 | 45篇 |
2012年 | 47篇 |
2011年 | 59篇 |
2010年 | 35篇 |
2009年 | 47篇 |
2008年 | 30篇 |
2007年 | 51篇 |
2006年 | 40篇 |
2005年 | 37篇 |
2004年 | 42篇 |
2003年 | 21篇 |
2002年 | 22篇 |
2001年 | 21篇 |
2000年 | 25篇 |
1999年 | 22篇 |
1998年 | 12篇 |
1997年 | 13篇 |
1996年 | 7篇 |
1995年 | 5篇 |
1994年 | 5篇 |
1993年 | 8篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有802条查询结果,搜索用时 171 毫秒
91.
Tsuyoshi Katayama 《海军后勤学研究》2001,48(7):638-651
We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001. 相似文献
92.
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 相似文献
93.
This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000 相似文献
94.
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 相似文献
95.
火力运用对策空间模型 总被引:1,自引:0,他引:1
根据空 -地作战的特点 ,提出了软、硬火力单位的概念 ,根据模型提出了作战指数、生存指数 ,为双方的实力与“保卫目标”的安全度分析提供了数量依据 ;根据微分对策和战术原则提出了规范作战模式等概念 ,为构造火力运用、兵力数量需求等算法搭起一个框架。 相似文献
96.
离散变结构系统的组合控制策略研究 总被引:4,自引:2,他引:2
对离散变结构控制系统的趋近律方法进行研究,提出了4种组合控制策略,它们可以明显改善系统的动态性能,并给出应用例子加以验证. 相似文献
97.
建筑消防设计中疏散时间的确定方法 总被引:1,自引:0,他引:1
郭艳丽 《中国人民武装警察部队学院学报》2000,16(5):9-11
本文针对建筑消防设计中疏散时间计算这一关键问题 ,利用疏散行为指数确定生活不能自理的人的疏散能力 ,进而确定其疏散时间 ,为建筑消防安全设计和防火管理工作提供理论依据。文中介绍的方法、计算公式及步骤简捷 ,具有一定的实用价值。 相似文献
98.
In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998 相似文献
99.
牛云 《国防科技大学学报》1990,12(2):55-57
本文利用椭圆弹道长轴方向有一常量的性质,计算了被动段弹道的射程和飞行时间。 相似文献
100.
单站无源定位跟踪技术中,可观测性分析是一个关键问题,但是由于TOA测量方程的非线性程度太高,直接通过计算Jacobin矩阵得到的可观测矩阵形式非常复杂,很难得出明确的分析结果。采用新的思路推导了一种TOA测量方程的线性化方程,分析了测量TOA和DOA单站无源定位的可观测条件。最后给出了计算机仿真结果。 相似文献