全文获取类型
收费全文 | 867篇 |
免费 | 21篇 |
出版年
2021年 | 13篇 |
2019年 | 28篇 |
2018年 | 22篇 |
2017年 | 20篇 |
2016年 | 21篇 |
2015年 | 19篇 |
2014年 | 14篇 |
2013年 | 190篇 |
2011年 | 8篇 |
2009年 | 12篇 |
2008年 | 11篇 |
2007年 | 9篇 |
2006年 | 10篇 |
2005年 | 19篇 |
2004年 | 17篇 |
2003年 | 12篇 |
2002年 | 9篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 18篇 |
1996年 | 16篇 |
1995年 | 9篇 |
1994年 | 19篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 26篇 |
1989年 | 15篇 |
1988年 | 12篇 |
1987年 | 23篇 |
1986年 | 15篇 |
1985年 | 19篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 10篇 |
1980年 | 11篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 14篇 |
1976年 | 12篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1973年 | 15篇 |
1972年 | 15篇 |
1971年 | 11篇 |
1970年 | 14篇 |
1969年 | 11篇 |
1968年 | 9篇 |
1967年 | 10篇 |
1966年 | 7篇 |
排序方式: 共有888条查询结果,搜索用时 15 毫秒
861.
862.
863.
864.
865.
We present techniques for classifying Markov chains with a continuous state space as either ergodic or recurrent. These methods are analogous to those of Foster for countable space chains. The theory is presented in the first half of the paper, while the second half consists of examples illustrating these techniques. The technique for proving ergodicity involves, in practice, three steps: showing that the chain is irreducible in a suitable sense; verifying that the mean hitting times on certain (usually bounded) sets are bounded, by using a “mean drift” criterion analogous to that of Foster; and finally, checking that the chain is such that bounded mean hitting times for these sets does actually imply ergodicity. The examples comprise a number of known and new results: using our techniques we investigate random walks, queues with waiting-time-dependent service times, dams with general and random-release rules, the s-S inventory model, and feedback models. 相似文献
866.
M. J. Fischer 《海军后勤学研究》1978,25(4):667-679
In this paper, we consider the analysis of two M/G/1 queueing systems sharing the same finite waiting room. An exact analysis is given for several special cases, and then an algorithm is developed which approximates the system behavior for the general problem. Comparisons are made between the special cases and the algorithm. 相似文献
867.
868.
A new approach is presented for analyzing multiple-attribute decision problems in which the set of actions is finite and the utility function is additive. The problem can be resolved if the decision makers (or group of decision makers) specifies a set of nonnegative weights for the various attributes or criteria, but we here assume that the decision maker(s) cannot provide a numerical value for each such weight. Ordinal information about these weights is therefore obtained from the decision maker(s), and this information is translated into a set of linear constraints which restrict the values of the weights. These constraints are then used to construct a polytope W of feasible weight vectors, and the subsets Hi (polytopes) of W over which each action ai has the greatest utility are determined. With the Comparative Hypervolume Criterion we calculate for each action the ratio of the hypervolume of Hi to the hypervolume of W and suggest the choice of an action with the largest such ratio. Justification of this choice criterion is given, and a computational method for accurately approximating the hypervolume ratios is described. A simple example is provided to evaluate the efficiency of a computer code developed to implement the method. 相似文献
869.
During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
870.
Sean M. Evans 《Low Intensity Conflict & Law Enforcement》2005,13(3):262-279
This paper underscores the theory that efficacious law enforcement intelligence addresses current problems of criminal insurgency including acts of terrorism, asymmetric warfare and low intensity conflict, and suggests possible solutions. By introducing the notion of crime as insurgency, a new paradigm may be developed that could assist practitioners and academics alike in analyzing, solving and managing crime. By shifting the perspective for both military and civilian forces from their traditionally reactive stance, to a proactive posture, and merging national security with homeland defense on the most perplexing issues and threats facing US security, this work may provide a base upon which new and actionable policies can be designed. Public administrators must take seriously the lessons from past failures. The single most important supposition being, sound policy is reliant upon good intelligence. 相似文献