全文获取类型
收费全文 | 631篇 |
免费 | 19篇 |
国内免费 | 1篇 |
出版年
2021年 | 11篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 8篇 |
2016年 | 12篇 |
2015年 | 6篇 |
2014年 | 11篇 |
2013年 | 112篇 |
2012年 | 8篇 |
2011年 | 5篇 |
2010年 | 6篇 |
2009年 | 7篇 |
2007年 | 14篇 |
2006年 | 7篇 |
2004年 | 5篇 |
2003年 | 9篇 |
2002年 | 9篇 |
2000年 | 5篇 |
1998年 | 9篇 |
1997年 | 11篇 |
1996年 | 13篇 |
1995年 | 5篇 |
1994年 | 11篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 15篇 |
1990年 | 11篇 |
1989年 | 21篇 |
1988年 | 18篇 |
1987年 | 10篇 |
1986年 | 19篇 |
1985年 | 14篇 |
1984年 | 9篇 |
1983年 | 6篇 |
1982年 | 14篇 |
1981年 | 10篇 |
1980年 | 15篇 |
1979年 | 14篇 |
1978年 | 15篇 |
1977年 | 6篇 |
1976年 | 10篇 |
1975年 | 14篇 |
1974年 | 14篇 |
1973年 | 11篇 |
1972年 | 8篇 |
1971年 | 10篇 |
1970年 | 9篇 |
1969年 | 9篇 |
1968年 | 6篇 |
1967年 | 6篇 |
排序方式: 共有651条查询结果,搜索用时 15 毫秒
51.
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. 相似文献
52.
Product support encompasses activities undertaken by durable goods producers to ensure their customers the continued use of the product. Examples of product support elements include after the sale activities such as providing repair services and warranty programs, as well as all the activities undertaken at the design and production stage to improve the reliability of products before they reach the market. The implications of incorporating customer costs while designing product support packages are the concern of this study. We study how the parameters of support package impact the costs incurred by customers and provide insights about selecting appropriate levels of product support. We show that the engineering orientation of maximizing the product's availability ignores market characteristics, and results in a mismatch between the corporation's support package and the customer's needs. The research is intended to be a step in understanding the interaction between design engineering parameters and customer's costs. © 1993 John Wiley & Sons, Inc. 相似文献
53.
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. 相似文献
54.
This article considers the problem of equipment replacement in which the replacement decision at a particular time must take into account (i) the state of the existing machine in use, (ii) the available replacement alternatives at the time, (iii) the future advances in the relevant technologies with regard to the equipment under consideration, and (iv) costs of switching between different technologies. A methodology that attains minimal forecast horizons for the problem is developed. A numerical example illustrates the methodology. 相似文献
55.
56.
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. 相似文献
57.
Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs. 相似文献
58.
We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions. 相似文献
59.
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. 相似文献
60.