全文获取类型
| 收费全文 | 957篇 |
| 免费 | 358篇 |
| 国内免费 | 14篇 |
专业分类
| 1329篇 |
出版年
| 2024年 | 12篇 |
| 2023年 | 8篇 |
| 2022年 | 14篇 |
| 2021年 | 19篇 |
| 2020年 | 17篇 |
| 2019年 | 17篇 |
| 2018年 | 28篇 |
| 2017年 | 34篇 |
| 2016年 | 60篇 |
| 2015年 | 53篇 |
| 2014年 | 72篇 |
| 2013年 | 53篇 |
| 2012年 | 74篇 |
| 2011年 | 74篇 |
| 2010年 | 62篇 |
| 2009年 | 79篇 |
| 2008年 | 55篇 |
| 2007年 | 68篇 |
| 2006年 | 67篇 |
| 2005年 | 54篇 |
| 2004年 | 61篇 |
| 2003年 | 40篇 |
| 2002年 | 46篇 |
| 2001年 | 42篇 |
| 2000年 | 27篇 |
| 1999年 | 32篇 |
| 1998年 | 27篇 |
| 1997年 | 27篇 |
| 1996年 | 27篇 |
| 1995年 | 7篇 |
| 1994年 | 18篇 |
| 1993年 | 12篇 |
| 1992年 | 18篇 |
| 1991年 | 8篇 |
| 1990年 | 11篇 |
| 1989年 | 4篇 |
| 1988年 | 2篇 |
排序方式： 共有1329条查询结果，搜索用时 15 毫秒
291.
In this article, we analyze a discrete‐time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count has no explicit form and is difficult to compute in certain parameter regimes. Using the Stein's method framework, we identify a continuous random variable to approximate the steady‐state customer count. The continuous random variable corresponds to the stationary distribution of a diffusion process with state‐dependent diffusion coefficients. We characterize the error bounds of this approximation under a variety of system load conditions—from lightly loaded to heavily loaded. We also identify the critical role that the service rate plays in the convergence rate of the error bounds. We perform extensive numerical experiments to support the theoretical findings and to demonstrate the approximation quality. In particular, we show that our approximation performs better than those based on constant diffusion coefficients when the number of servers is small, which is relevant to decision making in a single hospital ward. 相似文献
292.
In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014 相似文献
293.
Conventional control charts are often designed to optimize out‐of‐control average run length (ARL), while constraining in‐control ARL to a desired value. The widely employed grid search approach in statistical process control (SPC) is time‐consuming with unsatisfactory accuracy. Although the simulation‐based ARL gradient estimators proposed by Fu and Hu [Manag Sci 45 (1999), 395–413] can alleviate this issue, it still requires a large number of simulation runs to significantly reduce the variance of gradient estimators. This article proposes a novel ARL gradient estimation approach based on integral equation for efficient analysis and design of control charts. Although this article compares with the results of Fu and Hu [Manag Sci 45 (1999), 395–413] based on the exponentially weighted moving average (EWMA) control chart, the proposed approach has wide applicability as it can generally fit into any control chart with Markovian property under any distributions. It is shown that the proposed method is able to provide a fast, accurate, and easy‐to‐implement algorithm for the design and analysis of EWMA charts, as compared to the simulation‐based gradient estimation method. Moreover, the proposed gradient estimation method facilitates the computation of high‐order derivatives that are valuable in sensitivity analysis. The code is written in Matlab, which is available on request. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 223–237, 2014 相似文献
294.
295.
靶场在进行智能鱼雷鉴定试验任务时,实时准确地检测出鱼雷自导信号的频率成分是靶标信号处理中的重要环节,谱线比值法便是靶标进行信号处理时检测信号频率的一种有效方法。本文介绍了谱线比值法的基本原理,针对目前鱼雷自导信号特点,对该方法提出了改进方案并进行了仿真。仿真结果表明,经改进的谱线比值法能够满足靶标检测复杂鱼雷自导信号体制下信号频率的使用要求。 相似文献
296.
297.
298.
为适应“导航战”下的强干扰输入,导航接收机对模拟信道的动态范围提出了更高的要求。在给定的信噪比恶化容限约束下,原有的分析方法给出了二维曲线分析模型,得到了动态范围的优化设计及各级增益划分方法,但仅适用于输出功率基本不变的AGC电路。基于增加的AGC输出回退功率这一参数,论文提出了一种三维曲面求解模型,揭示了各电路参量与模拟信道动态范围的约束关系,可适用于输出功率变化的AGC电路,以实现更高的动态范围。针对三维模型中参数求解复杂的问题,利用纯衰减网络的特性将复杂的数值求解简化为直线求解,大幅降低了设计复杂度。在给出的设计实例中,动态范围测试结果与设计预期吻合较好,验证了方法的正确性。 相似文献
299.
基于TOPSIS评估算子的装甲装备作战能力评估 总被引：1，自引：1，他引：0
依据装甲装备作战能力评估问题的特点,采用TOPSIS方法评估装甲装备作战能力。装甲装备作战能力评估时,需构建基于TOPSIS方法的评估模型,支持装甲装备作战能力评估。算子是指定义了输入和输出,封装了一定操作的功能元件。从评估方法到评估算子元件的映射称为评估方法的算子化,生成的算子元件称为评估算子。将TOPSIS方法算子化为TOPSIS评估算子元件,运用TOPSIS算子元件构建装甲装备作战能力评估模型-算子树模型。算子树模型容易理解和调整,构建方便灵活,具有较好的重用性和扩展性,是解决装甲装备作战能力评估问题的一种有效途径。 相似文献
300.
分析了单一评估方法的局限性,基于兼容度准则提出一种将综合指数法和功效评分法等常用评估方法组合而成的一种综合评估方法,采用该方法对潜艇声纳的作战性能进行了评估分析.算例分析表明,该方法对于提高评估结果的可信性具有明显的作用. 相似文献