全文获取类型
收费全文 | 443篇 |
免费 | 5篇 |
出版年
2020年 | 5篇 |
2019年 | 6篇 |
2018年 | 11篇 |
2017年 | 13篇 |
2016年 | 14篇 |
2015年 | 5篇 |
2014年 | 6篇 |
2013年 | 146篇 |
2011年 | 4篇 |
2010年 | 5篇 |
2009年 | 4篇 |
2005年 | 9篇 |
2004年 | 3篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 8篇 |
1992年 | 10篇 |
1991年 | 12篇 |
1990年 | 3篇 |
1989年 | 7篇 |
1988年 | 3篇 |
1987年 | 12篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 10篇 |
1977年 | 3篇 |
1976年 | 5篇 |
1975年 | 5篇 |
1974年 | 9篇 |
1973年 | 4篇 |
1972年 | 4篇 |
1971年 | 4篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 4篇 |
1967年 | 3篇 |
排序方式: 共有448条查询结果,搜索用时 31 毫秒
331.
332.
James J. Wirtz 《Defense & Security Analysis》2017,33(2):106-114
The term “Gray Zone” is gaining in popularity as a way of describing contemporary security challenges. This article describes the “short-of-war” strategies – the fait accompli, proxy warfare, and the exploitation of ambiguous deterrence situations, i.e. “salami tactics” – that are captured by the term and offers several explanations for why state and non-state actors are drawn to these strategies. The analysis highlights why defense postures based on deterrence are especially vulnerable to the short-of-war strategies that populate the “Gray Zone.” The article concludes by suggesting how defense officials might adapt defense policies to life in the “Gray Zone.” 相似文献
333.
Radicalism or radicalisation has become a serious political and academic theme in recent years and any incident involving Muslims now almost automatically acquires the cachet, as events in 2016 and 2017 have shown. However, despite vast sums and resources expended on the subject no one can define what they mean by ‘it’. This should make us pause and question what precisely it is that causes so much alarm and is it worth the resources, time and effort employed to respond to it? 相似文献
334.
In the aftermath of the tragic events of 11 September 2001, numerous changes have been made to aviation security policy and operations throughout the nation's airports. The allocation and utilization of checked baggage screening devices is a critical component in aviation security systems. This paper formulates problems that model multiple sets of flights originating from multiple stations (e.g., airports, terminals), where the objective is to optimize a baggage screening performance measure subject to a finite amount of resources. These measures include uncovered flight segments (UFS) and uncovered passenger segments (UPS). Three types of multiple station security problems are identified and their computational complexity is established. The problems are illustrated on two examples that use data extracted from the Official Airline Guide. The examples indicate that the problems can provide widely varying solutions based on the type of performance measure used and the restrictions imposed by the security device allocations. Moreover, the examples suggest that the allocations based on the UFS measure also provide reasonable solutions with respect to the UPS measure; however, the reverse may not be the case. This suggests that the UFS measure may provide more robust screening device allocations. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
335.
Some properties of the geometric process are studied along with those of a related process which we propose to call the α‐series process. It is shown that the expected number of counts at an arbitrary time does not exist for the decreasing geometric process. The decreasing version of the α‐series process does have a finite expected number of counts, under certain conditions. This process also has the same advantages of tractability as the geometric process; it exhibits some properties which may make it a useful complement to the increasing geometric process. In addition, it may be fit to observed data as easily as the geometric process. Applications in reliability and stochastic scheduling are considered in order to demonstrate the versatility of the alternative model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
336.
Robert F. Dell James N. Eagle Gustavo Henrique Alves Martins Almir Garnier Santos 《海军后勤学研究》1996,43(4):463-480
The search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing approaches when used with only a single searcher. For more than one searcher, the time needed to guarantee an optimal solution is prohibitive. Our heuristics represent a wide variety of approaches: One solves partial problems optimally, two use paths based on maximizing the expected number of detections, two are genetic algorithm implementations, and one is local search with random restarts. A heuristic based on the expected number of detections obtains solutions within 2% of the best known for each one-, two-, and three-searcher test problem considered. For one- and two-searcher problems, the same heuristic's solution time is less than that of other heuristics. For three-searcher problems, a genetic algorithm implementation obtains the best-known solution in as little as 20% of other heuristic solution times. © 1996 John Wiley & Sons, Inc. 相似文献
337.
Capacity expansion refers to the process of adding facilities or manpower to meet increasing demand. Typical capacity expansion decisions are characterized by uncertain demand forecasts and uncertainty in the eventual cost of expansion projects. This article models capacity expansion within the framework of piecewise deterministic Markov processes and investigates the problem of controlling investment in a succession of same type projects in order to meet increasing demand with minimum cost. In particular, we investigate the optimality of a class of investment strategies called cutoff strategies. These strategies have the property that there exists some undercapacity level M such that the strategy invests at the maximum available rate at all levels above M and does not invest at any level below M. Cutoff strategies are appealing because they are straightforward to implement. We determine conditions on the undercapacity penalty function that ensure the existence of optimal cutoff strategies when the cost of completing a project is exponentially distributed. A by-product of the proof is an algorithm for determining the optimal strategy and its cost. © 1995 John Wiley & Sons, Inc. 相似文献
338.
For infinite-horizon replacement economy problems it is common practice to truncate the problem at some finite horizon. We develop bounds on the error due to such a truncation. These bounds differ from previous results in that they include both revenues and costs. Bounds are illustrated through a numerical example from a real case in vehicle replacement. © 1994 John Wiley & Sons, Inc. 相似文献
339.
We address a single-machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early completion penalties. Tardiness penalties arise from a variety of sources, such as loss of customer goodwill, opportunity costs of lost sales, and direct cash penalties. Accounting for earliness cost makes the performance measure nonregular, and this nonregularity has apparently discouraged researchers from seeking solutions to this problem. We found that it is not much more difficult to design an enumerative search for this problem than it would be if the performance measure were regular. We present and demonstrate an efficient timetabling procedure which can be embedded in an enumerative algorithm allowing the search to be conducted over the domain of job permutations.© 1993 John Wiley & Sons, Inc. 相似文献
340.