全文获取类型
收费全文 | 466篇 |
免费 | 6篇 |
专业分类
472篇 |
出版年
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年 | 4篇 |
1948年 | 3篇 |
排序方式: 共有472条查询结果,搜索用时 0 毫秒
141.
James Hasík 《Small Wars & Insurgencies》2014,25(5-6):1055-1062
Within the framework of classical theory, the joint US Army-Marine field manual Counterinsurgency (FM 3-24) described an ambitious set of skills required for success against guerrillas. But if counterinsurgency, as FM 3-24 describes it, is ‘the graduate level of warfare’, then these two military services have been for years systematically failing to train their talent in the appropriate fields. In today's small wars, NCOs serve as modern-day Mounties, and consequently require at least a modest undergraduate education in armed good governance. 相似文献
142.
In most western countries, there is a strong incentive for defence department budget-holders to expend all of the funds they are authorized to spend in a fiscal year. In this paper, we question whether this emphasis makes sense. We develop a model of a defence department’s operating expenditure assuming a fixed level of funding for a year and uncertain costs. The results of the model suggest that the incentive for departmental managers to expend all authorized funds is inefficient. We explore the implications of the model for the Department of National Defence (DND) in Canada in light of the recent criticism of DND lapsed funding by the Auditor-General of Canada. 相似文献
143.
144.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
145.
We examine the setup and improvement policies for a production process with multiple performance states. Assume that the production process deteriorates randomly over time, following a Markovian process with known transition probabilities. In order to reduce the production cost incurred because of process deterioration, the process is inspected at the end of each period. Then one of three actions may be taken: do nothing, perform routine process setup, or perform routine setup and process improvement. The routine setup operation returns the process to its best performance state, whereas the process improvement action may reduce future production and setup costs and improve the process-state transition probabilities. A discounted Markovian model is formulated to find the strategy that minimizes the total cost of operating the production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 383–400, 1997 相似文献
146.
In this paper, we consider approximations to discrete time Markov chains with countably infinite state spaces. We provide a simple, direct proof for the convergence of certain probabilistic quantities when one uses a northwest corner or a banded matrix approximation to the original probability transition matrix. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 187–197, 1999 相似文献
147.
This paper introduces a general or “distribution‐free” model to analyze the lifetime of components under accelerated life testing. Unlike the accelerated failure time (AFT) models, the proposed model shares the advantage of being “distribution‐free” with the proportional hazard (PH) model and overcomes the deficiency of the PH model not allowing survival curves corresponding to different values of a covariate to cross. In this research, we extend and modify the extended hazard regression (EHR) model using the partial likelihood function to analyze failure data with time‐dependent covariates. The new model can be easily adopted to create an accelerated life testing model with different types of stress loading. For example, stress loading in accelerated life testing can be a step function, cyclic, or linear function with time. These types of stress loadings reduce the testing time and increase the number of failures of components under test. The proposed EHR model with time‐dependent covariates which incorporates multiple stress loadings requires further verification. Therefore, we conduct an accelerated life test in the laboratory by subjecting components to time‐dependent stresses, and we compare the reliability estimation based on the developed model with that obtained from experimental results. The combination of the theoretical development of the accelerated life testing model verified by laboratory experiments offers a unique perspective to reliability model building and verification. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 303–321, 1999 相似文献
148.
In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038 相似文献
149.
150.
We consider the parallel replacement problem in which there are both fixed and variable costs associated with replacing machines. Increasing maintenance costs motivate replacements, and the fixed replacement cost provides incentive for replacing machines of different ages together in “clusters.” We prove two intuitive results for this problem. First, it is never optimal to split a cluster of like-aged machines, and second, it is never optimal to replace newer clusters before older clusters. By incorporating these two results into an algorithmic approach, we vastly reduce the amount of computation required to identify an optimal replacement policy. 相似文献