全文获取类型
收费全文 | 647篇 |
免费 | 188篇 |
国内免费 | 28篇 |
专业分类
863篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 6篇 |
2020年 | 16篇 |
2019年 | 15篇 |
2018年 | 7篇 |
2017年 | 40篇 |
2016年 | 37篇 |
2015年 | 34篇 |
2014年 | 44篇 |
2013年 | 89篇 |
2012年 | 40篇 |
2011年 | 37篇 |
2010年 | 38篇 |
2009年 | 48篇 |
2008年 | 47篇 |
2007年 | 56篇 |
2006年 | 48篇 |
2005年 | 37篇 |
2004年 | 38篇 |
2003年 | 27篇 |
2002年 | 22篇 |
2001年 | 26篇 |
2000年 | 22篇 |
1999年 | 10篇 |
1998年 | 11篇 |
1997年 | 10篇 |
1996年 | 7篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 7篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 10篇 |
1989年 | 4篇 |
1988年 | 3篇 |
排序方式: 共有863条查询结果,搜索用时 15 毫秒
691.
Acceptance sampling plans are used to assess the quality of an ongoing production process, in addition to the lot acceptance. In this paper, we consider sampling inspection plans for monitoring the Markov‐dependent production process. We construct sequential plans that satisfy the usual probability requirements at acceptable quality level and rejectable quality level and, in addition, possess the minimum average sample number under semicurtailed inspection. As these plans result in large sample sizes, especially when the serial correlation is high, we suggest new plans called “systematic sampling plans.” The minimum average sample number systematic plans that satisfy the probability requirements are constructed. Our algorithm uses some simple recurrence relations to compute the required acceptance probabilities. The optimal systematic plans require much smaller sample sizes and acceptance numbers, compared to the sequential plans. However, they need larger production runs to make a decision. Tables for choosing appropriate sequential and systematic plans are provided. The problem of selecting the best systematic sampling plan is also addressed. The operating characteristic curves of some of the sequential and the systematic plans are compared, and are observed to be almost identical. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 451–467, 2001 相似文献
692.
A mathematical formulation of an optimization model designed to select projects for inclusion in an R&D portfolio, subject to a wide variety of constraints (e.g., capital, headcount, strategic intent, etc.), is presented. The model is similar to others that have previously appeared in the literature and is in the form of a mixed integer programming (MIP) problem known as the multidimensional knapsack problem. Exact solution of such problems is generally difficult, but can be accomplished in reasonable time using specialized algorithms. The main contribution of this paper is an examination of two important issues related to formulation of project selection models such as the one presented here. If partial funding and implementation of projects is allowed, the resulting formulation is a linear programming (LP) problem which can be solved quite easily. Several plausible assumptions about how partial funding impacts project value are presented. In general, our examples suggest that the problem might best be formulated as a nonlinear programming (NLP) problem, but that there is a need for further research to determine an appropriate expression for the value of a partially funded project. In light of that gap in the current body of knowledge and for practical reasons, the LP relaxation of this model is preferred. The LP relaxation can be implemented in a spreadsheet (even for relatively large problems) and gives reasonable results when applied to a test problem based on GM's R&D project selection process. There has been much discussion in the literature on the topic of assigning a quantitative measure of value to each project. Although many alternatives are suggested, no one way is universally accepted as the preferred way. There does seem to be general agreement that all of the proposed methods are subject to considerable uncertainty. A systematic way to examine the sensitivity of project selection decisions to variations in the measure of value is developed. It is shown that the solution for the illustrative problem is reasonably robust to rather large variations in the measure of value. We cannot, however, conclude that this would be the case in general. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 18–40, 2001 相似文献
693.
王爱军 《中国人民武装警察部队学院学报》2002,18(5):35-37
根据化学危险品事故的特点及消防部队的装备配备情况 ,提出了一整套化学危险品事故抢险救援的程序 ,并介绍了处置过程中的关键技术。 相似文献
694.
In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999 相似文献
695.
We apply the techniques of response surface methodology (RSM) to approximate the objective function of a two‐stage stochastic linear program with recourse. In particular, the objective function is estimated, in the region of optimality, by a quadratic function of the first‐stage decision variables. The resulting response surface can provide valuable modeling insight, such as directions of minimum and maximum sensitivity to changes in the first‐stage variables. Latin hypercube (LH) sampling is applied to reduce the variance of the recourse function point estimates that are used to construct the response surface. Empirical results show the value of the LH method by comparing it with strategies based on independent random numbers, common random numbers, and the Schruben‐Margolin assignment rule. In addition, variance reduction with LH sampling can be guaranteed for an important class of two‐stage problems which includes the classical capacity expansion model. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 753–776, 1999 相似文献
696.
以“军械供应工程”项目中的子题目“弹药处废系统工程”为研究背景,运用多目标线性规则理论,建立弹药处度点布局和处废能力设计的决策模型,并对模型的求解进行研究。 相似文献
697.
698.
699.
随队支援干扰是现代空袭作战中重要的电子对抗手段,随队飞行过程中对干扰目标的选择是随队支援干扰飞机作战运用研究的重点和难点问题,详细分析了随队支援干扰飞机的作战阶段划分及主要作战行动,针对雷达网的探测距离和综合发现概率指标,建立了随队支援干扰下的计算模型,并主要尽可能地降低雷达网的综合发现概率,提出了基于动态规划的干扰目标选择辅助决策模型。最后,以某种作战背景为基础,进行了作战过程仿真和辅助决策结果分析,验证了该方法的可行性和有效性,该方法求得的结论也支持随队支援干扰飞机其他方面的作战运用研究。 相似文献
700.