全文获取类型
收费全文 | 221篇 |
免费 | 8篇 |
出版年
2019年 | 8篇 |
2018年 | 9篇 |
2017年 | 8篇 |
2016年 | 3篇 |
2015年 | 6篇 |
2014年 | 9篇 |
2013年 | 48篇 |
2012年 | 2篇 |
2011年 | 3篇 |
2010年 | 2篇 |
2009年 | 6篇 |
2006年 | 2篇 |
2004年 | 3篇 |
2003年 | 6篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 5篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 6篇 |
1973年 | 2篇 |
1972年 | 4篇 |
1971年 | 4篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1966年 | 1篇 |
1948年 | 1篇 |
排序方式: 共有229条查询结果,搜索用时 15 毫秒
121.
This study analyzes the determinants of arms production in 15 countries using annual panel data from 1997 to 2002. The results suggest that real GDP per capita, military expenditures, arms exports, and arms imports are positively related to arms production. 相似文献
122.
123.
We analyze the moments of the random time required for a vehicle to traverse a transportation network link of arbitrary length when its speed is governed by a random environment. The problem is motivated by stochastic transportation network applications in which the estimation of travel time moments is of great importance. We analyze this random time in a transient and asymptotic sense by employing results from the field of fluid queues. The results are demonstrated on two example problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
124.
Design reliability at the beginning of a product development program is typically low, and development costs can account for a large proportion of total product cost. We consider how to conduct development programs (series of tests and redesigns) for one‐shot systems (which are destroyed at first use or during testing). In rough terms, our aim is to both achieve high final design reliability and spend as little of a fixed budget as possible on development. We employ multiple‐state reliability models. Dynamic programming is used to identify a best test‐and‐redesign strategy and is shown to be presently computationally feasible for at least 5‐state models. Our analysis is flexible enough to allow for the accelerated stress testing needed in the case of ultra‐high reliability requirements, where testing otherwise provides little information on design reliability change. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
125.
126.
Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks 下载免费PDF全文
Noam Goldberg 《海军后勤学研究》2017,64(2):139-153
A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017 相似文献
127.
Existing theory on counterinsurgency does not adequately explain persistent insurrection in face of the reconstruction work currently underway in Afghanistan and Iraq. We starkly depart from the literature by developing a simple model of reconstruction allowing misalignment of occupier spending with community preferences. Insurgency arises endogenously as a result of the mix of spending rather than its level. Occupier insistence on its preferred path of reconstruction may lead to fewer projects of any kind being completed. In equilibrium, the occupier may accept an endogenous insurgency to achieve a preferred project mix, or be constrained in its choice even when no insurgency occurs. 相似文献
128.
In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000 相似文献
129.
The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001 相似文献
130.
This paper is concerned with the joint prior distribution of the dependent reliabilities of the components of a binary system. When this distribution is MTP2 (Multivariate Totally Positive of Order 2), it is shown in general that this actually makes the machinery of Natvig and Eide [7] available to arrive at the posterior distribution of the system's reliability, based on data both at the component and system level. As an illustration in a common environmental stress case, the joint prior distribution of the reliabilities is shown to have the MTP2 property. We also show, similarly to Gåsemyr and Natvig [3], for the case of independent components given component reliabilities how this joint prior distribution may be based on the combination of expert opinions. A specific system is finally treated numerically. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 741–755, 1997 相似文献