全文获取类型
收费全文 | 957篇 |
免费 | 16篇 |
出版年
2019年 | 18篇 |
2018年 | 10篇 |
2017年 | 27篇 |
2016年 | 17篇 |
2015年 | 18篇 |
2014年 | 19篇 |
2013年 | 209篇 |
2010年 | 10篇 |
2009年 | 14篇 |
2008年 | 11篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 13篇 |
2004年 | 16篇 |
2003年 | 10篇 |
2002年 | 15篇 |
2001年 | 7篇 |
2000年 | 11篇 |
1999年 | 11篇 |
1998年 | 15篇 |
1997年 | 10篇 |
1996年 | 14篇 |
1995年 | 14篇 |
1994年 | 22篇 |
1993年 | 20篇 |
1992年 | 15篇 |
1991年 | 24篇 |
1990年 | 14篇 |
1989年 | 19篇 |
1988年 | 23篇 |
1987年 | 25篇 |
1986年 | 25篇 |
1985年 | 21篇 |
1984年 | 10篇 |
1983年 | 13篇 |
1982年 | 17篇 |
1981年 | 12篇 |
1980年 | 12篇 |
1979年 | 11篇 |
1978年 | 14篇 |
1976年 | 11篇 |
1975年 | 9篇 |
1974年 | 15篇 |
1973年 | 14篇 |
1972年 | 14篇 |
1971年 | 11篇 |
1970年 | 13篇 |
1969年 | 12篇 |
1968年 | 10篇 |
1967年 | 10篇 |
排序方式: 共有973条查询结果,搜索用时 15 毫秒
61.
Lisa J. Campbell 《Low Intensity Conflict & Law Enforcement》2002,11(2):299-315
Since the global war on terror began, the pursuit of Al Qaeda is widely considered as warfare and not the pursuit of criminals. In light of counter-terrorism being redefined as war, the criteria applied for tracking militaries of conventional enemies may also be applicable to Al Qaeda. Intelligence analysts have long used the nine order-of-battle (OB) criteria as part of the estimative process for conventional, or nation-state, enemies. Applying OB criteria to Al Qaeda may assist intelligence analysts in knowing the enemy and identifying changes that will allow for predictive analysis. Many elements of Al Qaeda's OB prior to the events of 11 September were viewed as clutter and not significant changes that might have otherwise alerted intelligence analysts to the impending attack. This essay suggests how one might go about applying the nine OB criteria to analysis of Al Qaeda. Although more difficult and requiring modification, using an analytical procedure that has been tested successfully over many years is a logical step in the war on Al Qaeda. If all OB changes are tracked and analyzed using a systematic approach as outlined in this essay, Al Qaeda attacks may be predicted and/or curtailed in the future. 相似文献
62.
63.
64.
A linear-programming-based method for determining whether or not n demand points are on a hemisphere
Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush-Kuhn-Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc. 相似文献
65.
A new class of nonparametric reliability models is introduced and studied. A distribution is said to be better at age s than at age t (sBt) if the residual lifetime at age s is stochastically greater than or equal to the residual lifetime at age t. Applications to various forms of replacement policies, including the cannibalization of failed systems, are noted. For fixed s < t, the problem of estimating a survival curve assumed to belong to the sBt class is addressed using recursive methods. An sBt estimator is derived in closed form, and its uniform strong consistency at an optimal rate of convergence is demonstrated. A simulation study strongly supports the claim that the sBt estimator tends to outperform the empirical survivor function in small- and moderate-size samples. © 1993 John Wiley & Sons, Inc. 相似文献
66.
67.
In this article we investigate situations where the buyer is offered discounted price schedules from alternative vendors. Given various discount schedules, the buyer must make the best buying decision under a variety of constraints, such as limited storage space and restricted inventory budgets. Solutions to this problem can be utilized by the buyer to improve profitability. EOQ models for multiple products with all-units discounts are readily solvable in the absence of constraints spanning the products. However, constrained discounted EOQ models lack convenient mathematical properties. Relaxing the product-spanning constraints produces a dual problem that is separable, but lack of convexity and smoothness opens the door for duality gaps. In this research we present a set of algorithms that collectively find the optimal order vector. Finally, we present numerical examples using actual data. to illustrate the application of the algorithms. © 1993 John Wiley & Sons, Inc. 相似文献
68.
In this article we consider a project scheduling problem where there are cash flows throughout the life of the project and where shorter activity durations can be attained by incurring greater direct costs. In particular, the objective of this problem is to determine the activity durations and a schedule of activity start times so that the net present value of cash flows is maximized. We formulate this problem as a mixed-integer nonlinear program which is amenable to solution using the generalized Benders decomposition technique developed by Geoffrion. We test the algorithm on 140 project scheduling problems, the largest of which contains 30 nodes and 64 activities. Our computational results are quite encouraging inasmuch as 123 of the 140 problems require less than 1 CPU second of solution time. © 1993 John Wiley & Sons, Inc. 相似文献
69.
This article introduces a new conceptual and methodological framework for the use of decision makers and their interactions with the computer in bicriterion decision making. The new method, called the multirun interactive method, attempts to estimate the prior of the decision maker on his uncertain preference nature using the minimum cross-entropy principle. A computational study is performed with four hypothesized prior distributions under various interaction conditions. Other important aspects related to the method, such as implementation of the method, decision making under certainty, decision making with multiple decision makers, and bicriterion integer programming, are also discussed. 相似文献
70.
We consider the problem of finding a plan that maximizes the expected discounted return when extracting a nonrenewable resource having uncertain reserves. An extraction plan specifies the rate at which the resource is extracted as a function of time until the resource is exhausted or the time horizon is reached. The return per unit of resource extracted may depend on the rate of extraction, time, and the amount of resource previously extracted. We apply a new method called the generalized search optimization technique to find qualitative features of optimal plans and to devise algorithms for the numerical calculation of optimal plans. 相似文献