全文获取类型
收费全文 | 474篇 |
免费 | 13篇 |
出版年
2021年 | 5篇 |
2019年 | 12篇 |
2018年 | 10篇 |
2017年 | 12篇 |
2016年 | 7篇 |
2015年 | 8篇 |
2014年 | 8篇 |
2013年 | 107篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2009年 | 7篇 |
2008年 | 10篇 |
2006年 | 7篇 |
2005年 | 9篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 6篇 |
1998年 | 7篇 |
1997年 | 5篇 |
1996年 | 12篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 8篇 |
1992年 | 11篇 |
1991年 | 11篇 |
1990年 | 7篇 |
1989年 | 10篇 |
1988年 | 11篇 |
1987年 | 11篇 |
1986年 | 8篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 8篇 |
1980年 | 11篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 5篇 |
1975年 | 9篇 |
1974年 | 4篇 |
1971年 | 9篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 5篇 |
1967年 | 5篇 |
1966年 | 7篇 |
排序方式: 共有487条查询结果,搜索用时 31 毫秒
41.
An approximation for analyzing transient and nonstationary two-priority non-preemptive queueing systems is presented. This system has a three-dimensional state space, and through use of state-space partitioning in conjunction with use of conditional surrogate distributions with constant parameters an approximation is designed. Regardless of system capacity K, the approximation requires the numerical solution of only ten differential equations, compared to the K2 + K+1 Kolmogorov-forward equations required for the classic solution. Time-dependent approximations of the mean number of entities of type i and of the probability of a type-i entity being in service are obtained. Empirical test results over a wide range of systems indicate the approximation is quite accurate. 相似文献
42.
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. 相似文献
43.
The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
44.
Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
45.
Variations of Hale's channel assignment problem, the L(j, k)‐labeling problem and the radio labeling problem require the assignment of integers to the vertices of a graph G subject to various distance constraints. The λj,k‐number of G and the radio number of G are respectively the minimum span among all L(j, k)‐labelings, and the minimum span plus 1 of all radio labelings of G (defined in the Introduction). In this paper, we establish the λj,k‐number of ∏ K for pairwise relatively prime integers t1 < t2 < … < tq, t1 ≥ 2. We also show the existence of an infinite class of graphs G with radio number |V(G)| for any diameter d(G). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
46.
This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
47.
In 2013, the staff of the U.S. Nuclear Regulatory Commission estimated the reduction of the off-site economic losses from a fire in a drained U.S. spent fuel pool if fuel that had cooled for more than five years were transferred to dry cask storage—an option it called “expedited transfer.” In this article, it is shown that the savings would be much higher than the NRC estimated. Savings increase to about $2 trillion if: losses beyond 50 miles are included; the land-contamination threshold for long-term population relocation is changed to that used for the Chernobyl and Fukushima accidents and recommended by the U.S. Environmental Protection Agency; and, based on the experience of Japan, decontamination of land areas to levels acceptable for population return is assumed to take at least four years. If expedited transfer were implemented, the off-site economic losses would be reduced by about 98%. 相似文献
48.
Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness 下载免费PDF全文
We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines Mj, and the Mj subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017 相似文献
49.
50.
Adam D.M. Svendsen 《Defense & Security Analysis》2015,31(1):58-73
This article aims to encourage the fostering of more systems thinking, and its greater exploitation, within the domain of contemporary intelligence. With particular focus on “micro systems thinking” and with reference to key intelligence processes, such as intelligence analysis, the utility of many systems dynamics within the intelligence context seeks to be further revealed. Through their greater collective harnessing, including up to “System of Systems” (“SoS”) dynamics, and promoting all that they can offer, more sophisticated overarching operational-to-strategic/policy “ends,” notably that of “defence-in-depth,” can be viably further advanced in a sustainable manner into the future. Arguably, a much-needed transformative impact on contemporary intelligence can also be increasingly realised through comprehensively engaging in and with more systems and SoS thinking. Aiding civil protection tasks, crisis management, emergency planners, and civil contingency practitioners likewise gain. 相似文献