全文获取类型
收费全文 | 465篇 |
免费 | 6篇 |
出版年
2020年 | 6篇 |
2019年 | 8篇 |
2018年 | 4篇 |
2017年 | 13篇 |
2016年 | 9篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 121篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 4篇 |
2008年 | 5篇 |
2007年 | 5篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 4篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1999年 | 5篇 |
1996年 | 6篇 |
1995年 | 11篇 |
1994年 | 8篇 |
1993年 | 6篇 |
1992年 | 9篇 |
1991年 | 12篇 |
1989年 | 9篇 |
1988年 | 8篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 11篇 |
1984年 | 3篇 |
1983年 | 5篇 |
1982年 | 9篇 |
1980年 | 9篇 |
1979年 | 4篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1975年 | 8篇 |
1974年 | 11篇 |
1973年 | 10篇 |
1972年 | 6篇 |
1971年 | 9篇 |
1970年 | 6篇 |
1969年 | 6篇 |
1968年 | 7篇 |
1967年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有471条查询结果,搜索用时 203 毫秒
81.
The use of a single vendor for each inventoried item is usually assumed in most of the inventory models. However, there are situations where the use of more than one vendor should be considered, especially when lead times are stochastic. This research presents a theoretical investigation of the effect of cost structures on the relative performance of sole-sourcing versus dual-sourcing inventory control policies. We show that except for cases where the ordering cost is high, the lead-time variability is low, or the customer service level is low, dual sourcing performs better than sole sourcing under the normally distributed demand and shifted-exponential lead times. Moreover, the computational results indicate the dual sourcing provides a better service level than sole sourcing at the optimal solutions, and that dual sourcing results in larger order quantities than sole sourcing, which suggests that attractive quantity discounts may not be in jeopardy when dual sourcing is employed. Finally, because it is generally known that multiple sourcing can enhance the competition among suppliers, material managers should consider splitting purchase orders when two equally qualified suppliers are available. © 1994 John Wiley & Sons, Inc. 相似文献
82.
Adam D. Bramoweth James Luther Barbara H. Hanusa Jon D. Walker Charles W. Atwood Jr. Anne Germain 《Defence and Peace Economics》2018,29(1):78-90
AbstractInsomnia is prevalent among Veterans with post-traumatic stress disorder (PTSD), it exacerbates PTSD symptoms, and it contributes to impaired functioning and quality of life. To improve treatment outcomes, it is important to identify risk factors for insomnia and sedative-hypnotic use. Classification and regression trees and logistic regression models were used to identify variables associated with insomnia or sedative-hypnotic use. Key findings include low insomnia diagnosis rates (3.5–5.6%) and high rates of sedative-hypnotics (44.2–49.0%). Younger Veterans and those without a breathing-related sleep disorder (BRSD) were more likely to receive an insomnia diagnosis. Veterans with greater service connection and those with an alcohol/substance use disorder were more likely to be prescribed sedative-hypnotics. Interaction terms may have identified potential groups at risk of being under-diagnosed with insomnia (i.e. non-black Veterans with psychiatric co-morbidity, black Veterans without psychiatric co-morbidity) as well as groups at risk for sedative-hypnotic use (i.e. younger Veterans without BRSD). In sum, Veterans with PTSD have high rates of sedative-hypnotic use despite minimal evidence they are effective. This is counter to recommendations indicating behavioral interventions are the first-line treatment. Policy changes are needed to reduce use of sedative-hypnotics and increase access to behavioral insomnia interventions. 相似文献
83.
We consider a general linear filtering operation on an autoregressive moving average (ARMA) time series. The variance of the filter output, which is an important quantity in many applications, is not known with certainty because it depends on the true ARMA parameters. We derive an expression for the sensitivity (i.e., the partial derivative) of the output variance with respect to deviations in the model parameters. The results provide insight into the robustness of many common statistical methods that are based on linear filtering and also yield approximate confidence intervals for the output variance. We discuss applications to time series forecasting, statistical process control, and automatic feedback control of industrial processes. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
84.
The problem is to protect a set of t targets by n perfect interceptors against an attack by m perfect weapons. If the defender solves for an optimal preallocated preferential defense and associated game value assuming m1 attackers, and the attacker knows the assumption of the defender and utilizes m2 attackers, he may be able to achieve significantly more damage than had the defender assumed that there would be m2 attackers. The article treats the robustness of preallocated preferential defense to assumptions about the size of the attack and presents results of an alternative approach. 相似文献
85.
James L. Cook 《Journal of Military Ethics》2016,15(4):321-324
86.
A general age replacement is introduced which incorporates minimal repair, planned and unplanned replacements, and costs which depend on time. Finite and infinite horizon results are obtained. Various special cases are considered. Furthermore, a shock model with general cost structure is considered. 相似文献
87.
A. W. Kemp 《海军后勤学研究》1987,34(6):853-858
The article examines ways of computing cumulative probabilities for a constrained Poissonian binomial distribution arising from a model of a weapon defense system. 相似文献
88.
We present variants of a convergent Lagrangean relaxation algorithm for minimizing a strictly convex separable quadratic function over a transportation polytope. The algorithm alternately solves two “subproblems,” each of which has an objective function that is defined by using Lagrange multipliers derived from the other. Motivated by the natural separation of the subproblems into independent and very easily solved “subsubproblems,” the algorithm can be interpreted as the cyclic coordinate ascent method applied to the dual problem. We exhibit our computational results for different implementations of the algorithm applied to a set of large constrained matrix problems. 相似文献
89.
90.