全文获取类型
收费全文 | 542篇 |
免费 | 12篇 |
出版年
2021年 | 13篇 |
2019年 | 10篇 |
2018年 | 8篇 |
2017年 | 5篇 |
2016年 | 10篇 |
2014年 | 9篇 |
2013年 | 81篇 |
2012年 | 5篇 |
2009年 | 11篇 |
2007年 | 16篇 |
2005年 | 4篇 |
2004年 | 7篇 |
2003年 | 9篇 |
2002年 | 13篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 10篇 |
1997年 | 11篇 |
1996年 | 10篇 |
1995年 | 9篇 |
1994年 | 8篇 |
1993年 | 12篇 |
1992年 | 10篇 |
1991年 | 14篇 |
1990年 | 14篇 |
1989年 | 21篇 |
1988年 | 17篇 |
1987年 | 13篇 |
1986年 | 17篇 |
1985年 | 7篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 6篇 |
1975年 | 6篇 |
1974年 | 10篇 |
1973年 | 9篇 |
1972年 | 4篇 |
1971年 | 8篇 |
1970年 | 8篇 |
1969年 | 8篇 |
1968年 | 3篇 |
1967年 | 5篇 |
1948年 | 4篇 |
排序方式: 共有554条查询结果,搜索用时 46 毫秒
41.
42.
William R. Patterson 《Low Intensity Conflict & Law Enforcement》2002,11(1):77-93
Since the end of the Cold War the process of nation building has become a priority in the attempt to maintain world order and security in the wake of the instability and devastation wrought by failed and war-torn states. The proliferation of nation-building missions has led to their diversification and the need to marshal a vast array of resources in order to attain substantial levels of success. This article deals with a new and important component of peacekeeping and nation-building missions, that of civilian policing. The article outlines the goals of using civilian police officers in nation-building missions and discusses a variety of problems (pragmatic, legal, and cultural) that policing may introduce to such missions. This discussion is focused around the civilian policing component of the United Nations Mission in Kosovo. It delineates the successes and hardships so far experienced during the mission in Kosovo and explores the insights that the mission may provide for similar projects in the future. 相似文献
43.
Timothy Edmunds Antonia Dawes Paul Higate K. Neil Jenkings Rachel Woodward 《Defence Studies》2016,16(2):118-136
In recent years, there has been a sharp growth in political and sociological interest in the British military. Set against the backdrop of the armed forces’ increasing presence in everyday life, alongside the organizations’ ongoing restructuring, the current paper focuses on the MoD’s problematic attempts to recruit 30,000 reservists by 2020; what has become known as the Future Reserves 2020 programme (FR2020). We argue that these changes are driven in part by the need to cut costs in defence. However, we also suggest that they are a reflection of the changing nature of modern military organisation, and the manner in which armed forces engage with the societies of which they are a part, and with the citizens that make up that society. We locate FR2020 programme in the context of a wider narrative about the changing nature of military organisation in contemporary western democracies, identifying structural, circumstantial and normative reasons for change. We also examine the specific challenges of implementing FR2020 in practice, including issues of recruitment and retention, integration and support, and relations with families and employers, drawing on the experience of comparator countries to do so. We conclude by considering the implications of these changes, both for the future of UK armed forces, and for the evolving nature of military-society relations in Britain. 相似文献
44.
Gary R. Waissi 《海军后勤学研究》1993,40(3):393-414
A new algorithm is presented for finding maximal and maximum value flows in directed single-commodity networks. Commonly algorithms developed for this problem find a maximal flow by gradually augmenting (increasing) a feasible flow to a maximal flow. In the presented algorithm, at the beginning of each step or iteration, the flow on arcs is assigned to flow capacity. This may lead to an infeasible flow violating flow conservation at some nodes. During two passes of a MAIN step, consisting of a forward pass and a backward pass, the flow is reduced on some arcs to regain feasibility. The network is then pruned by omitting saturated arcs, and the process is repeated. The parallel implementation of the algorithm applies the two main steps at the same time to the same network. The outputs of the two steps are compared and the processing continues with the higher feasible flow. The algorithm is simple, intuitive, and efficient. © 1993 John Wiley & Sons, Inc. 相似文献
45.
We consider a system of N (nonsymmetric) machine centers of the K-out-of-M : G type that are maintained by a single repairman. [A machine center functions if and only if at least K of the M machines belonging to the center are good (G).] Such systems are commonly found in various manufacturing and service industries. A stochastic model is developed that accommodates generally distributed repair times and repairman walk times, and most repair scheduling disciplines. K-out-of-M : G type systems also appear as a modeling paradigm in reliability analysis and polling systems performance analysis. Several performance measures are derived for machine-repair systems having K-out-of-M-type centers. A simple example system is developed in detail that exposes the computations involved in modeling applications. © 1992 John Wiley & Sons, Inc. 相似文献
46.
This article details several procedures for using path control variates to improve the accuracy of simulation-based point and confidence-interval estimators of the mean completion time of a stochastic activity network (SAN). Because each path control variate is the duration of the corresponding directed path in the network from the source to the sink, the vector of selected path controls has both a known mean and a known covariance matrix. This information is incorporated into estimation procedures for both normal and nonnormal responses. To evaluate the performance of these procedures experimentally, we examine the bias, variance, and mean square error of the controlled point estimators as well as the average half-length and coverage probability of the corresponding confidence-interval estimators for a set of SANs in which the following characteristics are systematically varied: (a) the size of the network (number of nodes and arcs); (b) the topology of the network; (c) the percentage of activities with exponentially distributed durations; and (d) the relative dominance of the critical path. The experimental results show that although large improvements in accuracy can be achieved with some of these procedures, the confidence-interval estimators for normal responses may suffer serious loss of coverage probability in some applications. 相似文献
47.
Cumulative search-evasion games (CSEGs) are two-person zero-sum search-evasion games where play proceeds throughout some specified period without interim feedback to either of the two players. Each player moves according to a preselected plan. If (Xt, Yt,) are the positions of the two players at time t, then the game's payoff is the sum over t from 1 to T of A(Xt, Yt, t). Additionally, all paths must be “connected.” That is, the finite set of positions available for a player in any time period depends on the position selected by that player in the previous time period. One player attempts to select a mixed strategy over the feasible T-time period paths to maximize the expected payoff. The other minimizes. Two solution procedures are given. One uses the Brown-Robinson method of fictitious play and the other linear programming. An example problem is solved using both procedures. 相似文献
48.
49.
A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc. 相似文献
50.
This article analyzes a one-to-one ordering perishable inventory model with renewal demands and exponential lifetimes. The leadtimes are independently and exponentially distributed and the demands that occur during stock out periods are lost. Although the items are assumed to decay at a constant rate, the output process is not renewal and the Markov renewal techniques are successfully employed to obtain the operating characteristics. The problem of minimizing the long run expected cost rate is discussed and numerical values of optimal stock level are also provided. © 1996 John Wiley & Sons, Inc. 相似文献