全文获取类型
收费全文 | 409篇 |
免费 | 16篇 |
专业分类
425篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 7篇 |
2017年 | 9篇 |
2016年 | 9篇 |
2015年 | 8篇 |
2014年 | 7篇 |
2013年 | 68篇 |
2011年 | 4篇 |
2009年 | 4篇 |
2007年 | 6篇 |
2006年 | 3篇 |
2005年 | 4篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 6篇 |
2001年 | 8篇 |
2000年 | 4篇 |
1999年 | 10篇 |
1998年 | 9篇 |
1997年 | 9篇 |
1996年 | 7篇 |
1995年 | 11篇 |
1994年 | 13篇 |
1993年 | 11篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 8篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 6篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 6篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 6篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1970年 | 3篇 |
1969年 | 3篇 |
1968年 | 5篇 |
1967年 | 4篇 |
排序方式: 共有425条查询结果,搜索用时 9 毫秒
401.
T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least Ki of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest Ki and allocates functioning components to subsystems in increasing order of the Ki's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the Ki's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001 相似文献
402.
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 相似文献
403.
Timothy J. Lomperis 《Small Wars & Insurgencies》2016,27(1):132-153
In a military intervention, do surges work? I compare the failed ‘surge’ in Vietnam, the repulse of the Easter Invasion in 1972, as a means of assessing the more ambiguous surges in Iraq and Afghanistan. I identify four features of a surge for this analysis: the military dimensions and strategy of the surging forces, the military capabilities of the host forces, the political vitality and will of the host country, and the political commitment in the domestic politics of the intervener. I find that the last feature is the most critical; and, in all three surges, the American political commitment was lacking. 相似文献
404.
This article argues that since the advent of democracy, the South African Police Service (SAPS) has been plagued by poor administration. Having inherited a repressive police force, the post-apartheid national police commissioners (NPCs) have found it difficult to transform the organisation. Among the unintended consequences has been a rise in police deaths. Although police deaths can be attributed to numerous factors, this article focuses on fault lines in the SAPS administration through a strengths, weaknesses, opportunities and threats (SWOT) analysis drawing largely on existing scholarly debates. Essential theoretical perspectives have been employed to gain insight into the root causes of the problem. The article concludes that poor administration and a lack of trust, partnership and collaboration between police officers and community members have perpetuated the killing of police officers. These killings are further compounded by the flawed and ill-conceived selection and appointment of NPCs. As a consequence, the article recommends that the appointment of NPCs should be promptly reviewed. It further recommends that each potential candidate should have risen through the ranks and must fully comprehend the challenges facing the organisation. 相似文献
405.
The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options 下载免费PDF全文
This article generalizes the dynamic and stochastic knapsack problem by allowing the decision‐maker to postpone the accept/reject decision for an item and maintain a queue of waiting items to be considered later. Postponed decisions are penalized with delay costs, while idle capacity incurs a holding cost. This generalization addresses applications where requests of scarce resources can be delayed, for example, dispatching in logistics and allocation of funding to investments. We model the problem as a Markov decision process and analyze it through dynamic programming. We show that the optimal policy with homogeneous‐sized items possesses a bithreshold structure, despite the high dimensionality of the decision space. Finally, the value (or price) of postponement is illustrated through numerical examples. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 267–292, 2015 相似文献
406.
Inventory models with nonlinear shortage costs and stochastic lead times; applications of shape properties of randomly stopped counting processes 下载免费PDF全文
In this article, we study generalizations of some of the inventory models with nonlinear costs considered by Rosling in (Oper. Res. 50 (2002) 797–809). In particular, we extend the study of both the periodic review and the compound renewal demand processes from a constant lead time to a random lead time. We find that the quasiconvexity properties of the cost function (and therefore the existence of optimal (s, S) policies), holds true when the lead time has suitable log‐concavity properties. The results are derived by structural properties of renewal delayed processes stopped at an independent random time and by the study of log‐concavity properties of compound distributions. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 345–356, 2015 相似文献
407.
Freedom C. Onuoha 《African Security Review》2014,23(4):405-411
Trafficking in persons in Nigeria has largely targeted adults and children, particularly women and girls. Of growing concern, however, is the recent emergence and growth of sophisticated and syndicated groups involved in baby ‘factories’ and trafficking in Nigeria. This article examines the nature, actors, modus operandi and motives behind this emergent dimension of human trafficking in Nigeria. It concludes that if concerted efforts are not made to deal with the actors and dismantle the market, its profitability will embolden current actors and even encourage new entrants into the booming trade – now and in the future. 相似文献
408.
C. Christine Fair 《Small Wars & Insurgencies》2014,25(1):205-235
This essay reviews seven recent books and reports that focus upon the use of US armed drones in Pakistan's Federally Administered Tribal Areas (FATA). This essay synthesizes a historical account of the program, critically interrogates key arguments and evidence advanced by the authors, and draws attention the particular problems that confront those who live in the FATA and the second-class citizenship that the Pakistani state has bestowed upon them for reasons of domestic and foreign policy concerns. This review essay does not intend to be the final word on any of the ongoing policy debates. But it does hope to enable a wider audience to take part in these important deliberations. 相似文献
409.
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work 下载免费PDF全文
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
410.
George C. Canavos 《海军后勤学研究》1975,22(3):543-552
The robustness of the assigned prior distribution in a Bayesian estimation problem is examined. A Bayesian analysis for a stochastic intensity parameter of a Poisson distribution is summarized in which the natural conjugate is assigned as the prior distribution of the random parameter. The sensitivity analysis is carried out by assuming the existence of a true prior which is different in form from that of the assigned prior distribution. By using mean-squared error as a measure of performance, the ensuing Bayes decision function is compared to the corresponding minimum variance unbiased estimator. Results indicate that the Bayes estimator is largely robust to deviations from the assigned prior and remains squared-error superior to the MVU type within a broad region. 相似文献